Lupa

Search the repository Help

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

Options:
  Reset


31 - 40 / 46
First pagePrevious page12345Next pageLast page
31.
Archimedean maps of higher genera
Roman Nedela, Ján Karabáš, 2012, original scientific article

Found in: ključnih besedah
Summary of found: ...maps, graphs, embedding, ...
Keywords: maps, graphs, embedding
Published: 03.04.2017; Views: 773; Downloads: 91
URL Full text (0,00 KB)

32.
33.
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ...ector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs, ...
Keywords: vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs
Published: 03.04.2017; Views: 556; Downloads: 19
URL Full text (0,00 KB)

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

Found in: ključnih besedah
Summary of found: ...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: 990; Downloads: 11
URL Full text (0,00 KB)
This document has more files! More...

35.
On the readability of overlap digraphs
Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, 2016, original scientific article

Found in: ključnih besedah
Summary of found: ...bipartite graphs, readability, overlap labeling, ...
Keywords: bipartite graphs, readability, overlap labeling
Published: 08.08.2016; Views: 1223; Downloads: 147
URL Full text (0,00 KB)

36.
Counterexamples to three conjectures on equistable graphs
Martin Milanič, Nicolas Trotignon, 2015, published scientific conference contribution abstract

Found in: ključnih besedah
Keywords: ekvistabilen graf, Orlinova domneva, protiprimer, equistable graphs, Orlin's conjecture, counterexample
Published: 08.08.2016; Views: 914; Downloads: 4
URL Full text (0,00 KB)

37.
Grafi struktur proteinov
Miloš Tomić, 2017, undergraduate thesis

Found in: ključnih besedah
Summary of found: ...proteins, amino acids, graph theory, protein graphs, radius of a graph, average shortest path,...
Keywords: proteins, amino acids, graph theory, protein graphs, radius of a graph, average shortest path, average node degree, graph energy
Published: 09.11.2017; Views: 446; Downloads: 9
URL Full text (0,00 KB)

38.
Nove karakterizacije v strukturni teoriji grafov
Tatiana Romina Hartinger, 2017, doctoral dissertation

Found in: ključnih besedah
Summary of found: ...orientable graph, structural characterization of families of graphs, chordal graph, interval graph, circular arc graph,...
Keywords: 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
Published: 09.11.2017; Views: 522; Downloads: 8
URL Full text (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, original scientific article

Abstract: 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.
Found in: ključnih besedah
Keywords: distance-regular graphs, terwilliger algebra, subconstituent algebra
Published: 14.11.2017; Views: 524; Downloads: 40
URL Full text (0,00 KB)

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