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


1 - 6 / 6
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Quasi m-Cayley circulants
Ademir Hujdurović, 2013, objavljeni znanstveni prispevek na konferenci

Opis: A graph ▫$\Gamma$▫ is called a quasi ▫$m$▫-Cayley graph on a group ▫$G$▫ if there exists a vertex ▫$\infty \in V(\Gamma)$▫ and a subgroup ▫$G$▫ of the vertex stabilizer ▫$\text{Aut}(\Gamma)_\infty$▫ of the vertex ▫$\infty$▫ in the full automorphism group ▫$\text{Aut}(\Gamma)$▫ of ▫$\Gamma$▫, such that ▫$G$▫ acts semiregularly on ▫$V(\Gamma) \setminus \{\infty\}$▫ with ▫$m$▫ orbits. If the vertex ▫$\infty$▫ is adjacent to only one orbit of ▫$G$▫ on ▫$V(\Gamma) \setminus \{\infty\}$▫, then ▫$\Gamma$▫ is called a strongly quasi ▫$m$▫-Cayley graph on ▫$G$▫ .In this paper complete classifications of quasi 2-Cayley, quasi 3-Cayley and strongly quasi 4-Cayley connected circulants are given.
Najdeno v: ključnih besedah
Povzetek najdenega: ...arc-transitive, circulant, quasi m-Cayley graph...
Ključne besede: arc-transitive, circulant, quasi m-Cayley graph
Objavljeno: 15.10.2013; Ogledov: 1642; Prenosov: 54
URL Polno besedilo (0,00 KB)

2.
On Hamiltonicity of circulant digraphs of outdegree three
Štefko Miklavič, Primož Šparl, 2009, izvirni znanstveni članek

Opis: This paper deals with Hamiltonicity of connected loopless circulant digraphs of outdegree three with connection set of the form ▫$\{a,ka,c\}$▫, where ▫$k$▫ is an integer. In particular, we prove that if ▫$k=-1$▫ or ▫$k=2$▫ such a circulant digraph is Hamiltonian if and only if it is not isomorphic to the circulant digraph on 12 vertices with connection set ▫$\{3,6,4\}$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: graph theory, circulant digraph, Hamilton cycle
Objavljeno: 15.10.2013; Ogledov: 1270; Prenosov: 45
URL Polno besedilo (0,00 KB)

3.
Algebraični aspekti teorije grafov
Ademir Hujdurović, 2013, doktorska disertacija

Najdeno v: ključnih besedah
Povzetek najdenega: ...circulant, bicirculant, semiregular automorphism, vertex-transitive graph, half-arc-transi...
Ključne besede: circulant, bicirculant, semiregular automorphism, vertex-transitive graph, half-arc-transitive graph, snark, Cayley graph, quasi m-Cayley graph, generalized Cayley graph, I-regular action, regular cover of a graph, automorphism group
Objavljeno: 10.07.2015; Ogledov: 1532; Prenosov: 4
URL Polno besedilo (0,00 KB)

4.
Symmetry structure of bicirculants
Boštjan Frelih, Primož Šparl, Aleksander Malnič, Dragan Marušič, 2007, izvirni znanstveni članek

Opis: An ▫$n$▫-bicirculant is a graph having an automorphism with two orbits of length ▫$n$▫ and no other orbits. Symmetry properties of ▫$p$▫-bicirculants, ▫$p$▫ a prime, are extensively studied. In particular, the actions of their automorphism groups are described in detail in terms of certain algebraic representation of such graphs.
Najdeno v: ključnih besedah
Povzetek najdenega: ...mathematics, graph theory, graph, circulant, bicirculant, automorphism group...
Ključne besede: mathematics, graph theory, graph, circulant, bicirculant, automorphism group
Objavljeno: 03.04.2017; Ogledov: 959; Prenosov: 50
URL Polno besedilo (0,00 KB)

5.
On strongly regular bicirculants
Dragan Marušič, Aleksander Malnič, Primož Šparl, 2007, izvirni znanstveni članek

Opis: An ▫$n$▫-bicirculantis a graph having an automorphism with two orbits of length ▫$n$▫ and no other orbits. This article deals with strongly regular bicirculants. It is known that for a nontrivial strongly regular ▫$n$▫-bicirculant, ▫$n$▫ odd, there exists a positive integer m such that ▫$n=2m^2+2m+1▫$. Only three nontrivial examples have been known previously, namely, for ▫$m=1,2$▫ and 4. Case ▫$m=1$▫ gives rise to the Petersen graph and its complement, while the graphs arising from cases ▫$m=2$▫ and ▫$m=4$▫ are associated with certain Steiner systems. Similarly, if ▫$n$▫ is even, then ▫$n=2m^2$▫ for some ▫$m \ge 2$▫. Apart from a pair of complementary strongly regular 8-bicirculants, no other example seems to be known. A necessary condition for the existence of a strongly regular vertex-transitive ▫$p$▫-bicirculant, ▫$p$▫ a prime, is obtained here. In addition, three new strongly regular bicirculants having 50, 82 and 122 vertices corresponding, respectively, to ▫$m=3,4$▫ and 5 above, are presented. These graphs are not associated with any Steiner system, and together with their complements form the first known pairs of complementary strongly regular bicirculants which are vertex-transitive but not edge-transitive.
Najdeno v: ključnih besedah
Povzetek najdenega: ...mathematics, graph theory, graph, circulant, bicirculant, automorphism group...
Ključne besede: mathematics, graph theory, graph, circulant, bicirculant, automorphism group
Objavljeno: 03.04.2017; Ogledov: 1015; Prenosov: 44
URL Polno besedilo (0,00 KB)

6.
Automorphism groups of circulant digraphs with applications to semigroup theory
Joao Araújo, Wolfram Bentz, Edward Dobson, Janusz Konieczny, Joy Morris, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: Zadetek v naslovu
Ključne besede: automorphism group, circulant digraph, semigroup
Objavljeno: 08.05.2018; Ogledov: 794; Prenosov: 72
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