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 - 76 / 76
Na začetekNa prejšnjo stran12345678Na naslednjo stranNa konec
71.
Hamiltonicity of vertex-transitive graphs of order 4p
Klavdija Kutnar, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: It is shown that every connected vertex-transitive graph of order ▫$4p$▫, where ▫$p$▫ is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path.
Ključne besede: graph theory, vertex-transitive graphs, Hamilton cycle, automorphism group
Objavljeno v RUP: 15.10.2013; Ogledov: 3661; Prenosov: 39
URL Povezava na celotno besedilo

72.
Hamilton paths in vertex-transitive graphs of order 10p
Klavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, izvirni znanstveni članek

Opis: It is shown that every connected vertex-transitive graph of order ▫$10p$▫, ▫$p \ne 7$▫ a prime, which is not isomorphic to a quasiprimitive graph arising from the action of PSL▫$(2,k)$▫ on cosets of ▫$\mathbb{Z}_k \times \mathbb{Z}_{(k-1)/10}$▫, contains a Hamilton path.
Ključne besede: graph, vertex-transitive, Hamilton cycle, Hamilton path, automorphism group
Objavljeno v RUP: 15.10.2013; Ogledov: 3602; Prenosov: 40
URL Povezava na celotno besedilo

73.
An unusual decomposition of a complete 7-partite graph of order 28
Edward Dobson, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: A decomposition of the complete 7-partite graph on 28 vertices where each set in the partition has four vertices is given. Several unusual properties of this decomposition are discussed, giving rise to several natural questions.
Ključne besede: matematika, teorija grafov, po točkah tranzitivni grafi, faktorizacija
Objavljeno v RUP: 15.10.2013; Ogledov: 3507; Prenosov: 84
URL Povezava na celotno besedilo

74.
On prime-valent symmetric bicirculants and Cayley snarks
Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2013, objavljeni znanstveni prispevek na konferenci

Ključne besede: graph, Cayley graph, arc-transitive, snark, semiregular automorphism, bicirculant
Objavljeno v RUP: 15.10.2013; Ogledov: 3430; Prenosov: 156
URL Povezava na celotno besedilo

75.
Classification of cubic symmetric tricirculants
István Kovács, Klavdija Kutnar, Dragan Marušič, Steve Wilson, 2012, izvirni znanstveni članek

Ključne besede: symmetric graph, semiregular, tricirculant
Objavljeno v RUP: 15.10.2013; Ogledov: 3434; Prenosov: 82
URL Povezava na celotno besedilo

76.
Vertex-transitive expansions of (1, 3)-trees
Marko Lovrečič Saražin, Dragan Marušič, 2010, objavljeni znanstveni prispevek na konferenci

Opis: A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same length. Given a graph ▫$X$▫ with a semiregular automorphism ▫$\gamma$▫, the quotient of ▫$X$▫ relative to ▫$\gamma$▫ is the multigraph ▫$X/\gamma$▫ whose vertices are the orbits of ▫$\gamma$▫ and two vertices are adjacent by an edge with multiplicity ▫$r$▫ if every vertex of one orbit is adjacent to ▫$r$▫ vertices of the other orbit. We say that ▫$X$▫ is an expansion of ▫$X/\gamma$▫. In [J.D. Horton, I.Z. Bouwer, Symmetric ▫$Y$▫-graphs and ▫$H$▫-graphs, J. Combin. Theory Ser. B 53 (1991) 114-129], Hortonand Bouwer considered a restricted sort of expansions (which we will call :strong" in this paper) where every leaf of ▫$X/\gamma$▫ expands to a single cycle in ▫$X$▫. They determined all cubic arc-transitive strong expansions of simple ▫$(1,3)$▫-trees, that is, trees with all of their vertice shaving valency 1 or 3, thus extending the classical result of Frucht, Graver and Watkins (see [R. Frucht, J.E. Graver, M.E. Watkins, The groups of the generalized Petersen graphs, Proc. Cambridge Philos. Soc. 70 (1971) 211-218]) about arc-transitive strong expansions of ▫$K_2$▫ (also known as the generalized Petersen graphs). In this paper another step is taken further by considering the possible structure of cubic vertex-transitive expansions of general ▫$(1,3)$▫-multitrees (where vertices with double edges are also allowed); thus the restriction on every leaf to be expanded to a single cycle is dropped.
Ključne besede: graph, tree, cubic, vertex-transitive, arc-transitive, expansion
Objavljeno v RUP: 15.10.2013; Ogledov: 4039; Prenosov: 80
URL Povezava na celotno besedilo

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