scholarly journals On Certain Edge-Transitive Bicirculants

10.37236/7588 ◽  
2019 ◽  
Vol 26 (2) ◽  
Author(s):  
Robert Jajcay ◽  
Štefko Miklavič ◽  
Primož Šparl ◽  
Gorazd Vasiljević

A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding semiregular automorphism is a cycle, have been studied, at least for the few smallest possible valences. For valences $3$, $4$ and $5$, where the corresponding bicirculants are called generalized Petersen graphs, Rose window graphs and Tabač jn graphs, respectively, all edge-transitive members have been classified. While there are only 7 edge-transitive generalized Petersen graphs and only 3 edge-transitive Tabač jn graphs, infinite families of edge-transitive Rose window graphs exist. The main theme of this paper is the question of the existence of such bicirculants for higher valences. It is proved that infinite families of edge-transitive examples of valence $6$ exist and among them infinitely many arc-transitive as well as infinitely many half-arc-transitive members are identified. Moreover, the classification of the ones of valence $6$ and girth $3$ is given. As a corollary, an infinite family of half-arc-transitive graphs of valence $6$ with universal reachability relation, which were thus far not known to exist, is obtained.

Author(s):  
Brian Alspach ◽  
Dragan Marušič ◽  
Lewis Nowitz

AbstractAn infinite family of vertex-and edge-transitive, but not arc-transitive, graphs of degree 4 is constructed.


2019 ◽  
Vol 486 (4) ◽  
pp. 411-415
Author(s):  
Young Soo Kwon ◽  
A. D. Mednykh ◽  
I. A. Mednykh

In the present paper, we study the complexity of an infinite family of graphs Hn = Hn(G1, G2, ..., Gm) that are discrete Seifert foliations over a graph H on m vertices with fibers G1, G2, ..., Gm. Each fiber Gi = Cn(si,1, si,2, ..., si,ki) of this foliation is the circulant graph on n vertices with jumps si,1, si,2, ..., si,ki. The family of discrete Seifert foliations is sufficiently large. It includes the generalized Petersen graphs, I-graphs, Y-graphs, H-graphs, sandwiches of circulant graphs, discrete torus graph and others. We obtain a closed formula for the number t(n) of spanning trees in Hn in terms of Chebyshev polynomials, investigate some arithmetical properties of this function and find its asymptotics as n → ∞.


Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 336
Author(s):  
Zehui Shao ◽  
Rija Erveš ◽  
Huiqin Jiang ◽  
Aljoša Peperko ◽  
Pu Wu ◽  
...  

A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3} with the properties that if f(u)=0, then vertex u is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and if f(u)=1, then vertex u is adjacent to at least one vertex assigned 2 or 3. The weight of f equals w(f)=∑v∈Vf(v). The double Roman domination number γdR(G) of a graph G is the minimum weight of a double Roman dominating function of G. A graph is said to be double Roman if γdR(G)=3γ(G), where γ(G) is the domination number of G. We obtain the sharp lower bound of the double Roman domination number of generalized Petersen graphs P(3k,k), and we construct solutions providing the upper bounds, which gives exact values of the double Roman domination number for all generalized Petersen graphs P(3k,k). This implies that P(3k,k) is a double Roman graph if and only if either k≡0 (mod 3) or k∈{1,4}.


1989 ◽  
Vol 78 (1-2) ◽  
pp. 169-177 ◽  
Author(s):  
Gerald Schrag ◽  
Larry Cammack

2012 ◽  
Vol 160 (4-5) ◽  
pp. 436-447 ◽  
Author(s):  
Sarah Spence Adams ◽  
Paul Booth ◽  
Harold Jaffe ◽  
Denise Sakai Troxell ◽  
S. Luke Zinnen

2007 ◽  
Vol 307 (3-5) ◽  
pp. 534-543 ◽  
Author(s):  
Marko Lovrečič Saražin ◽  
Walter Pacco ◽  
Andrea Previtali

Author(s):  
Kuo-Hua Wu ◽  
Yue-Li Wang ◽  
Chiun-Chieh Hsu ◽  
Chao-Cheng Shih

Sign in / Sign up

Export Citation Format

Share Document