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 - 9 / 9
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Edge-transitive core-free Nest graphs
István Kovács, 2025, izvirni znanstveni članek

Opis: A finite simple graph Γ is called a Nest graph if it is regular of valency 6 and admits an automorphism ρ with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle. We say that Γ is core-free if no non-trivial subgroup of the group generated by ρ is normal in Aut(Γ). In this paper, we show that, if Γ is edge-transitive and core-free, then it is isomorphic to one of the following graphs: the complement of the Petersen graph, the Hamming graph H(2,4), the Shrikhande graph and a certain normal 2-cover of K_{3,3} by ℤ_2^4.
Ključne besede: bicirculant, edge-transitive, primitive permutation group
Objavljeno v RUP: 10.09.2025; Ogledov: 445; Prenosov: 4
.pdf Celotno besedilo (466,20 KB)

2.
On 3-isoregularity of multicirculants
Klavdija Kutnar, Dragan Marušič, Štefko Miklavič, 2025, izvirni znanstveni članek

Opis: A graph is said to be k-isoregular if any two vertex subsets of cardinality at most k, that induce subgraphs of the same isomorphism type, have the same number of neighbors. It is shown that no 3-isoregular bicirculant (and more generally, no locally 3-isoregular bicirculant) of order twice an odd number exists. Further, partial results for bicirculants of order twice an even number as well as tricirculants of specific orders, are also obtained. Since 3-isoregular graphs are necessarily strongly regular, a motivation for the above result about bicirculants is that it brings us a step closer to obtaining a direct proof of a classical consequence of the Classification of Finite Simple Groups, that no simply primitive group of degree twice a prime exists for primes greater than 5.
Ključne besede: 3-isoregularity, strongly regular graph, bicirculant, tricirculant
Objavljeno v RUP: 06.08.2025; Ogledov: 482; Prenosov: 6
.pdf Celotno besedilo (233,35 KB)

3.
Bicirculants via imprimitivity block systems
Dragan Marušič, 2021, izvirni znanstveni članek

Ključne besede: semiregular group, imprimitive group, arc-transitive graph, bicirculant
Objavljeno v RUP: 06.05.2021; Ogledov: 2141; Prenosov: 34
URL Povezava na celotno besedilo

4.
On certain edge-transitive bicirculants
Robert Jajcay, Štefko Miklavič, Primož Šparl, Gorazd Vasiljević, 2019, izvirni znanstveni članek

Ključne besede: bicirculant, edge-transitive, half-arc transitive
Objavljeno v RUP: 18.07.2019; Ogledov: 3186; Prenosov: 125
URL Povezava na celotno besedilo

5.
Symmetry structure of bicirculants
Aleksander Malnič, Dragan Marušič, Primož Šparl, Boštjan Frelih, 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.
Ključne besede: mathematics, graph theory, graph, circulant, bicirculant, automorphism group
Objavljeno v RUP: 03.04.2017; Ogledov: 4118; Prenosov: 105
URL Povezava na celotno besedilo

6.
On strongly regular bicirculants
Aleksander Malnič, Dragan Marušič, 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.
Ključne besede: mathematics, graph theory, graph, circulant, bicirculant, automorphism group
Objavljeno v RUP: 03.04.2017; Ogledov: 12277; Prenosov: 100
URL Povezava na celotno besedilo

7.
8.
On generalized Cayley graphs
Klavdija Kutnar, 2013, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: vertex-transitive, bicirculant, generalized Cayley graph
Objavljeno v RUP: 15.10.2013; Ogledov: 9281; Prenosov: 42
URL Povezava na celotno besedilo

9.
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: 5184; Prenosov: 162
URL Povezava na celotno besedilo

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