Lupa

Search the repository Help

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

Options:
  Reset


71 - 80 / 198
First pagePrevious page45678910111213Next pageLast page
71.
Linear separation of connected dominating sets in graphs
Martin Milanič, Nina Chiarelli, 2014, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph, ...
Keywords: povezana dominantna množica, hereditarni grafovski razred, dualno Spernerjev hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph
Published: 15.10.2015; Views: 1362; Downloads: 55
URL Full text (0,00 KB)

72.
Computational aspects of lifting automorphisms
Rok Požar, 2015, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...covering projection, graph, lifting automorphsim, ...
Keywords: covering projection, graph, lifting automorphsim
Published: 15.10.2015; Views: 901; Downloads: 5
URL Full text (0,00 KB)

73.
Half-arc-transitive group actions with a small number of alternets
Klavdija Kutnar, 2015, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...automorphism group, half-arc-tranistive graph, alternet, ...
Keywords: automorphism group, half-arc-tranistive graph, alternet
Published: 15.10.2015; Views: 1168; Downloads: 9
URL Full text (0,00 KB)

74.
On the full automorphism group in vertex-transitive graphs
Dragan Marušič, 2015, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...odd automorphism, automorphism group, graph, ...
Keywords: odd automorphism, automorphism group, graph
Published: 15.10.2015; Views: 939; Downloads: 14
URL Full text (0,00 KB)

75.
On the split structure of lifted groups
Aleksander Malnič, Rok Požar, 2016, original scientific article

Found in: ključnih besedah
Summary of found: ...algorithm, abelian cover, Cayley voltages, covering projection, graph, group extension, group presentation, lifting automorphisms, linear...
Keywords: algorithm, abelian cover, Cayley voltages, covering projection, graph, group extension, group presentation, lifting automorphisms, linear systems over the integers, semidirect product
Published: 15.10.2015; Views: 1147; Downloads: 65
URL Full text (0,00 KB)

76.
On spectral radius and energy of complete multipartite graphs
Ivan Gutman, Dragan Stevanović, Masood U. Rehman, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ...spectral radius, complete multipartite graph, graph energy, complete split graph, Turan graph,...
Keywords: spectral radius, complete multipartite graph, graph energy, complete split graph, Turan graph
Published: 15.10.2015; Views: 1182; Downloads: 77
URL Full text (0,00 KB)

77.
Cubic symmetric graphs via odd automorphisms, 60th Birthday Lecture Series, Department of Mathematics, University of Auckland, New Zealand, 10 September 2015
Klavdija Kutnar, 2015, invited lecture at foreign university

Found in: ključnih besedah
Summary of found: ...cubic graph, symmetric, automorphism, odd permutation, ...
Keywords: cubic graph, symmetric, automorphism, odd permutation
Published: 15.10.2015; Views: 1140; Downloads: 10
URL Full text (0,00 KB)

78.
On the readability of overlap digraphs
Paul Medvedev, Martin Milanič, Rayan Chikhi, Sofya Raskhodnikova, 2015, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...bipartite graph, readability, overlap labeling, ...
Keywords: bipartite graph, readability, overlap labeling
Published: 15.10.2015; Views: 1410; Downloads: 71
URL Full text (0,00 KB)

79.
Reachability relations in digraphs
Norbert Seifter, Boris Zgrablić, Aleksander Malnič, Primož Šparl, Dragan Marušič, 2008, original scientific article

Abstract: In this paper we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight of a walk is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed in the direction opposite to their orientation. Then, a vertex ▫$u$▫ is ▫$R_k^+$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at u has weight in the interval ▫$[0,k]$▫. Similarly, a vertex ▫$u$▫ is ▫$R_k^-$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at ▫$u$▫ has weight in the interval ▫$[-k,0]$▫. For all positive integers ▫$k$▫, the relations ▫$R_k^+$▫ and ▫$R_k^-$▫ are equivalence relations on the vertex set of a given digraph. We prove that, for transitive digraphs, properties of these relations are closely related to other properties such as having property ▫$\mathbb{Z}$▫, the number of ends, growth conditions, and vertex degree.
Found in: ključnih besedah
Summary of found: ... graph theory, digraph, reachability relations, end of a...
Keywords: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Published: 03.04.2017; Views: 1013; Downloads: 95
URL Full text (0,00 KB)

80.
On cyclic edge-connectivity of fullerenes
Dragan Marušič, Klavdija Kutnar, 2008, original scientific article

Abstract: A graph is said to be cyclically ▫$k$▫-edge-connected, if at least ▫$k$▫ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of ▫$k$▫ edges is called a cyclic-k-edge cutset and it is called a trivial cyclic-k-edge cutset if at least one of the resulting two components induces a single ▫$k$▫-cycle. It is known that fullerenes, that is, 3-connected cubic planar graphs all of whose faces are pentagons and hexagons, are cyclically 5-edge-connected. In this article it is shown that a fullerene ▫$F$▫ containing a nontrivial cyclic-5-edge cutset admits two antipodal pentacaps, that is, two antipodal pentagonal faces whose neighboring faces are also pentagonal. Moreover, it is shown that ▫$F$▫ has a Hamilton cycle, and as a consequence at least ▫$15 \cdot 2^{n/20-1/2}$▫ perfect matchings, where ▫$n$▫ is the order of ▫$F$▫.
Found in: ključnih besedah
Summary of found: ...A graph is said to be cyclically ▫$k$▫-edge-connected, if...
Keywords: graph, fullerene graph, cyclic edge-connectivity, hamilton cycle, perfect matching
Published: 03.04.2017; Views: 813; Downloads: 96
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