Abstract
An n-bicirculant (in short, a bicirculant) is a graph admitting a non-identity automorphism having two cycles of equal length n in its cycle decomposition (called a (2,n)-semiregular automorphism). A graph is said to be symmetric if its automorphism group acts transitively on the set of its arcs. In this paper it is shown that a connected bicirculant X ≠ K 4 of prime valency admitting a group of automorphisms containing a (2,n)-semiregular automorphism and acting regularly on the set of arcs is near-bipartite (that is, with the chromatic number at most 3). Combining this result with the theory of Cayley maps new partial results are obtained in regards to the well-known conjecture that there are no snarks amongst Cayley graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alspach, B., Liu, Y.-P., Zhang, C.-Q.: Nowhere-zero 4-flows and Cayley graphs on solvable groups. SIAM J. Discrete Math. 9, 151–154 (1996)
Dixon, J.D., Mortimer, B.: Permutation groups. Springer (1996)
Feng, Y.-Q., Li, Y.-T.: One-regular graphs of square-free order of prime valency. European J. Combin. 32, 265–275 (2011)
Frucht, R., Graver, J.E., Watkins, M.E.: The groups of the generalized Petersen graphs. Proc. Camb. Phil. Soc. 70, 211–218 (1971)
Glover, H.H., Yang, T.Y.: A Hamilton cycle in the Cayley graph of the (2, p, 3)-presentation of PSL 2(p). Discrete Math. 160, 149–163 (1996)
Glover, H.H., Marušič, D.: Hamiltonicity of cubic Cayley graphs. Eur. Math. Soc. 9, 775–787 (2007)
Glover, H.H., Kutnar, K., Marušič, D.: Hamiltonian cycles in cubic Cayley graphs: the 〈2,4k,3〉 case. Algebraic Combin. 30, 447–475 (2009)
Glover, H.H., Kutnar, K., Malnič, A., Marušič, D.: Hamilton cycles in (2,odd,3)-Cayley graphs. Proc. London Math. Soc. 104, 1171–1197 (2012)
Herzog, M., Kaplan, G.: Large cyclic subgroups contain non-trivial normal subgroups. Group Theory 4, 247–253 (2001)
Hujdurović, A., Kutnar, K.: Marušič, D.: Cubic Cayley Graphs and Snarks. Communications Series of the Fields Institute (accepted)
Kovács, I.: Classifying arc-transitive circulants. Algebr. Combin. 20, 353–358 (2004)
Kovács, I., Kuzman, B., Malnič, A., Wilson, S.: Characterization of edge-transitive 4-valent bicirculants. Graph Theory 69, 441–463 (2012)
Kovács, I., Marušič, D., Muzychuk, M.: On G-arc-regular dihedrants and regular dihedral maps. Algebraic Combin., 1–19 (2012), doi:10.1007/s10801-012-0410-0
Kutnar, K., Marušič, D., Morris, D.W., Morris, J., Šparl, P.: Hamiltonian cycles in Cayley graphs whose order has few prime factors. Ars. Math. Contemp. 5, 27–71 (2012)
Kwak, J.H., Kwon, Y.S., Oh, J.-M.: Infinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency. Combin. Theory Ser. B 98, 585–598 (2008)
Li, C.H.: Permutation groups with a cyclic regular subgroup and arc-transitive circulants. Algebraic Combin. 21, 131–136 (2005)
Lovász, L.: Combinatorial structures and their applications. In: Proc. Calgary Internat. Conf., Calgary, Alberta, 1969, pp. 243–246, Problem 11, Gordon and Breach, New York (1970)
Marušič, D., Pisanski, T.: Symmetries of hexagonal molecular graphs on the torus. Croat. Chem. Acta 73, 969–981 (2000)
Nedela, R., Škoviera, M.: Cayley snarks and almost simple groups. Combinatorica 21, 583–590 (2001)
Pisanski, T.: A classification of cubic bicirculants. Discrete Math. 307, 567–578 (2007)
Potočnik, P.: Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms. Combin. Theory Ser. B 91, 289–300 (2004)
Wielandt, H.: Finite Permutation Groups. Academic Press, New York (1964)
Xu, M.Y.: Automorphism groups and isomorphisms of Cayley digraphs. Discrete Math. 182, 309–320 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hujdurović, A., Kutnar, K., Marušič, D. (2013). On Prime-Valent Symmetric Bicirculants and Cayley Snarks. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2013. Lecture Notes in Computer Science, vol 8085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40020-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-40020-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40019-3
Online ISBN: 978-3-642-40020-9
eBook Packages: Computer ScienceComputer Science (R0)