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


71 - 80 / 187
Na začetekNa prejšnjo stran45678910111213Na naslednjo stranNa konec
71.
Linear separation of connected dominating sets in graphs
Martin Milanič, Nina Chiarelli, 2014, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph, ...
Ključne besede: povezana dominantna množica, hereditarni grafovski razred, dualno Spernerjev hipergraf, pragovni hipergraf, connected dominating set, hereditary graph class, dually Sperner hypergraph, treshold hypergraph
Objavljeno: 15.10.2015; Ogledov: 1179; Prenosov: 39
URL Polno besedilo (0,00 KB)

72.
Computational aspects of lifting automorphisms
Rok Požar, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...covering projection, graph, lifting automorphsim, ...
Ključne besede: covering projection, graph, lifting automorphsim
Objavljeno: 15.10.2015; Ogledov: 698; Prenosov: 5
URL Polno besedilo (0,00 KB)

73.
Half-arc-transitive group actions with a small number of alternets
Klavdija Kutnar, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...automorphism group, half-arc-tranistive graph, alternet, ...
Ključne besede: automorphism group, half-arc-tranistive graph, alternet
Objavljeno: 15.10.2015; Ogledov: 930; Prenosov: 9
URL Polno besedilo (0,00 KB)

74.
On the full automorphism group in vertex-transitive graphs
Dragan Marušič, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...odd automorphism, automorphism group, graph, ...
Ključne besede: odd automorphism, automorphism group, graph
Objavljeno: 15.10.2015; Ogledov: 792; Prenosov: 13
URL Polno besedilo (0,00 KB)

75.
On the split structure of lifted groups
Aleksander Malnič, Rok Požar, 2016, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...algorithm, abelian cover, Cayley voltages, covering projection, graph, group extension, group presentation, lifting automorphisms, linear...
Ključne besede: algorithm, abelian cover, Cayley voltages, covering projection, graph, group extension, group presentation, lifting automorphisms, linear systems over the integers, semidirect product
Objavljeno: 15.10.2015; Ogledov: 961; Prenosov: 52
URL Polno besedilo (0,00 KB)

76.
On spectral radius and energy of complete multipartite graphs
Ivan Gutman, Dragan Stevanović, Masood U. Rehman, 2015, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...spectral radius, complete multipartite graph, graph energy, complete split graph, Turan graph,...
Ključne besede: spectral radius, complete multipartite graph, graph energy, complete split graph, Turan graph
Objavljeno: 15.10.2015; Ogledov: 1008; Prenosov: 54
URL Polno besedilo (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, predavanje na tuji univerzi

Najdeno v: ključnih besedah
Povzetek najdenega: ...cubic graph, symmetric, automorphism, odd permutation, ...
Ključne besede: cubic graph, symmetric, automorphism, odd permutation
Objavljeno: 15.10.2015; Ogledov: 1033; Prenosov: 10
URL Polno besedilo (0,00 KB)

78.
On the readability of overlap digraphs
Paul Medvedev, Martin Milanič, Rayan Chikhi, Sofya Raskhodnikova, 2015, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...bipartite graph, readability, overlap labeling, ...
Ključne besede: bipartite graph, readability, overlap labeling
Objavljeno: 15.10.2015; Ogledov: 1246; Prenosov: 57
URL Polno besedilo (0,00 KB)

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

Opis: 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.
Najdeno v: ključnih besedah
Povzetek najdenega: ...graph theory, digraph, reachability relations, end of a...
Ključne besede: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Objavljeno: 03.04.2017; Ogledov: 816; Prenosov: 72
URL Polno besedilo (0,00 KB)

80.
On cyclic edge-connectivity of fullerenes
Dragan Marušič, Klavdija Kutnar, 2008, izvirni znanstveni članek

Opis: 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$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: ...A graph is said to be cyclically ▫$k$▫-edge-connected, if...
Ključne besede: graph, fullerene graph, cyclic edge-connectivity, hamilton cycle, perfect matching
Objavljeno: 03.04.2017; Ogledov: 654; Prenosov: 73
URL Polno besedilo (0,00 KB)

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