Natisni
Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


31 - 40 / 46
Na začetekNa prejšnjo stran12345Na naslednjo stranNa konec
31.
Archimedean maps of higher genera
Roman Nedela, Ján Karabáš, 2012, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...maps, graphs, embedding, ...
Ključne besede: maps, graphs, embedding
Objavljeno: 03.04.2017; Ogledov: 773; Prenosov: 91
URL Polno besedilo (0,00 KB)

32.
33.
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi, 2015, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...ector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs, ...
Ključne besede: vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs
Objavljeno: 03.04.2017; Ogledov: 554; Prenosov: 19
URL Polno besedilo (0,00 KB)

34.
Odčitljivost digrafov in dvodelnih grafov
Vladan Jovičić, 2016, diplomsko delo

Najdeno v: ključnih besedah
Povzetek najdenega: ...linear program, distinctness, decomposition, HUB-number, two-dimensional grid graphs, toroidal grid graphs...
Ključne besede: readability, overlap graph, labeling, integer linear program, distinctness, decomposition, HUB-number, two-dimensional grid graphs, toroidal grid graphs
Objavljeno: 09.08.2016; Ogledov: 989; Prenosov: 11
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

35.
On the readability of overlap digraphs
Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, 2016, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...bipartite graphs, readability, overlap labeling, ...
Ključne besede: bipartite graphs, readability, overlap labeling
Objavljeno: 08.08.2016; Ogledov: 1222; Prenosov: 147
URL Polno besedilo (0,00 KB)

36.
Counterexamples to three conjectures on equistable graphs
Martin Milanič, Nicolas Trotignon, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: ključnih besedah
Ključne besede: ekvistabilen graf, Orlinova domneva, protiprimer, equistable graphs, Orlin's conjecture, counterexample
Objavljeno: 08.08.2016; Ogledov: 914; Prenosov: 4
URL Polno besedilo (0,00 KB)

37.
Grafi struktur proteinov
Miloš Tomić, 2017, diplomsko delo

Najdeno v: ključnih besedah
Povzetek najdenega: ...proteins, amino acids, graph theory, protein graphs, radius of a graph, average shortest path,...
Ključne besede: proteins, amino acids, graph theory, protein graphs, radius of a graph, average shortest path, average node degree, graph energy
Objavljeno: 09.11.2017; Ogledov: 446; Prenosov: 9
URL Polno besedilo (0,00 KB)

38.
Nove karakterizacije v strukturni teoriji grafov
Tatiana Romina Hartinger, 2017, doktorska disertacija

Najdeno v: ključnih besedah
Povzetek najdenega: ...orientable graph, structural characterization of families of graphs, chordal graph, interval graph, circular arc graph,...
Ključne besede: 1-perfectly orientable graph, structural characterization of families of graphs, chordal graph, interval graph, circular arc graph, cograph, block-cactus graph, cobipartite graph, K4-minor-free graph, outerplanar graph, graph product, Cartesian product, lexicographic product, direct product, strong product, price of connectivity, cycle transversal, path transversal
Objavljeno: 09.11.2017; Ogledov: 520; Prenosov: 8
URL Polno besedilo (0,00 KB)

39.
On the Terwilliger algebra of bipartite distance-regular graphs with [Delta][sub]2 = 0 and c[sub]2=1
Mark MacLean, Štefko Miklavič, Safet Penjić, 2016, izvirni znanstveni članek

Opis: Let ▫$\Gamma$▫ denote a bipartite distance-regular graph with diameter ▫$D \geq 4$▫ and valency ▫$k \geq 3$▫. Let ▫$X$▫ denote the vertex set of ▫$\Gamma$▫, and let ▫$A$▫ denote the adjacency matrix of ▫$\Gamma$▫. For ▫$x \in X$▫ and for ▫$0 \leq i \leq D$▫, let ▫$\operatorname{\Gamma}_i(x)$▫ denote the set of vertices in ▫$X$▫ that are distance ▫$i$▫ from vertex ▫$x$▫. Define a parameter ▫$\operatorname{\Delta}_2$▫ in terms of the intersection numbers by ▫$\operatorname{\Delta}_2 = (k - 2)(c_3 - 1) -(c_2 - 1) p_{22}^2$▫. We first show that ▫$\operatorname{\Delta}_2 = 0$▫ implies that ▫$D \leq 5$▫ or ▫$c_2 \in \{1, 2 \}$▫. For ▫$x \in X$▫ let ▫$T = T(x)$▫ denote the subalgebra of ▫$\text{Mat}_X(\mathbb{C})$▫ generated by ▫$A, E_0^\ast, E_1^\ast, \ldots, E_D^\ast$▫, where for ▫$0 \leq i \leq D$, $E_i^\ast$▫ represents the projection onto the▫ $i$▫th subconstituent of ▫$\Gamma$▫ with respect to ▫$x$▫. We refer to ▫$T$▫ as the Terwilliger algebra of ▫$\Gamma$▫ with respect to ▫$x$▫. By the endpoint of an irreducible ▫$T$▫-module ▫$W$▫ we mean ▫$\min \{i | E_i^\ast W \ne 0 \}$▫. In this paper we assume ▫$\Gamma$▫ has the property that for ▫$2 \leq i \leq D - 1$▫, there exist complex scalars ▫$\alpha_i$▫, ▫$\beta_i$▫ such that for all ▫$x, y, z \in X$▫ with ▫$\partial(x, y) = 2$▫, ▫$\partial(x, z) = i$▫, ▫$\partial(y, z) = i$▫, we have ▫$\alpha_i + \beta_i | \operatorname{\Gamma}_1(x) \cap \operatorname{\Gamma}_1(y) \cap \operatorname{\Gamma}_{i - 1}(z) | = | \operatorname{\Gamma}_{i - 1}(x) \cap \operatorname{\Gamma}_{i - 1}(y) \cap \operatorname{\Gamma}_1(z) |$▫. We additionally assume that▫ $\operatorname{\Delta}_2 = 0$▫ with ▫$c_2 = 1$▫. Under the above assumptions we study the algebra ▫$T$▫. We show that if ▫$\Gamma$▫ is not almost 2-homogeneous, then up to isomorphism there exists exactly one irreducible ▫$T$▫-module with endpoint 2. We give an orthogonal basis for this ▫$T$▫-module, and we give the action of ▫$A$▫ on this basis.
Najdeno v: ključnih besedah
Ključne besede: distance-regular graphs, terwilliger algebra, subconstituent algebra
Objavljeno: 14.11.2017; Ogledov: 522; Prenosov: 40
URL Polno besedilo (0,00 KB)

40.
Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici