Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 10 / 10
First pagePrevious page1Next pageLast page
1.
The number and size of firms
Štefan Bojnec, Ana Xavier, 2004, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: number of firms, ownership, inactive firms, firm size, manufacturing, Slovenia
Published: 15.10.2013; Views: 1043; Downloads: 25
URL Full text (0,00 KB)
This document has more files! More...

2.
The plane-width of graphs
Marcin Kamiński, Paul Medvedev, Martin Milanič, 2011, original scientific article

Found in: ključnih besedah
Summary of found: ......
Keywords: plane-width, realization of a graph, packing non-overlapping unit disks, chromatic number, circular chromatic number
Published: 15.10.2013; Views: 1237; Downloads: 35
URL Full text (0,00 KB)

3.
A note on domination and independence-domination numbers of graphs
Martin Milanič, 2013, published scientific conference contribution

Abstract: Vizing's conjecture is true for graphs ▫$G$▫ satisfying ▫$\gamma^i(G) = \gamma(G)$▫, where ▫$\gamma(G)$▫ is the domination number of a graph ▫$G$▫ and ▫$\gamma^i(G)$▫ is the independence-domination number of ▫$G$▫, that is, the maximum, over all independent sets ▫$I$▫ in ▫$G$▫, of the minimum number of vertices needed to dominate ▫$I$▫. The equality ▫$\gamma^i(G) = \gamma(G)$▫ is known to hold for all chordal graphs and for chordless cycles of length ▫$0 \pmod{3}$▫. We prove some results related to graphs for which the above equality holds. More specifically, we show that the problems of determining whether ▫$\gamma^i(G) = \gamma(G) = 2$▫ and of verifying whether ▫$\gamma^i(G) \ge 2$▫ are NP-complete, even if ▫$G$▫ is weakly chordal. We also initiate the study of the equality ▫$\gamma^i = \gamma$▫ in the context of hereditary graph classes and exhibit two infinite families of graphs for which ▫$\gamma^i < \gamma$▫.
Found in: ključnih besedah
Summary of found: ......
Keywords: Vizing's conjecture, domination number, independence-domination number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph
Published: 15.10.2013; Views: 1350; Downloads: 74
URL Full text (0,00 KB)

4.
Maximum genus, connectivity, and Nebeský's theorem
Martin Škoviera, Roman Nedela, Dan Steven Archdeacon, Michal Kotrbčík, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ......
Keywords: maksimalen rod, Nebeskýnov rod, Bettijevo število, povezanost, maximum genus, Nebeský theorem, Betti number, connectivity
Published: 15.10.2015; Views: 1144; Downloads: 74
URL Full text (0,00 KB)

5.
Diskretni SIR epidemični modeli in dinamika virusov gripe
Klemen Krnel, 2015, undergraduate thesis

Found in: ključnih besedah
Summary of found: ......
Keywords: mathematical model, SIR model, epidemic, influenza, basic reproduction number
Published: 15.10.2015; Views: 1512; Downloads: 8
URL Full text (0,00 KB)

6.
Odčitljivost digrafov in dvodelnih grafov
Vladan Jovičić, 2016, undergraduate thesis

Found in: ključnih besedah
Summary of found: ...graph, labeling, integer linear program, distinctness, decomposition, HUB-number, two-dimensional grid graphs, toroidal grid graphs...
Keywords: readability, overlap graph, labeling, integer linear program, distinctness, decomposition, HUB-number, two-dimensional grid graphs, toroidal grid graphs
Published: 09.08.2016; Views: 1094; Downloads: 12
URL Full text (0,00 KB)
This document has more files! More...

7.
On the balanced upper chromatic number of cyclic projective planes and projective spaces
Gabriela Araujo-Pardo, György Kiss, Amanda Montejano, 2015, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: balanced rainbow-free colorings, upper chromatic number, projective planes, projective spaces
Published: 08.08.2016; Views: 968; Downloads: 106
URL Full text (0,00 KB)

8.
Odd automorphisms in graphs
Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2018, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ......
Keywords: vertex-transitive odd number, odd automorphism, graph
Published: 07.02.2018; Views: 1107; Downloads: 15
URL Full text (0,00 KB)

9.
Relative blocking sets of unions of Baer subplanes
Aart Blokhuis, L. Storme, Tamás Szönyi, 2019, original scientific article

Found in: ključnih besedah
Summary of found: ......
Keywords: blocking sets, Baer subplanes, relative blocking sets, fractional cover, fractional covering number
Published: 01.08.2019; Views: 192; Downloads: 91
URL Full text (0,00 KB)

10.
On the upper chromatic number and multiple blocking sets of PG(n,q)
Zoltán L. Blázsik, Tamás Héger, Tamás Szönyi, 2020, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: upper chromatic number, hypergraph, n-dimensional projective space PG(n, q)
Published: 18.03.2020; Views: 15; Downloads: 5
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica