The Structure of Cayley Graph of Dihedral Groups of Valency 4
Abstract
Let G be a group and S be a subset of G in which e /∈ S and S−1 ⊆ S. The Cayley graph of group G with respect to subset S, denoted by Cay(G, S), is an undirected simple graph whose vertices are all elements of G, and two vertices x and y are adjacent if and only if xy−1 ∈ S. If |S| = k, then Cay(G, S) is called a Cayley graph of valency k. The aim of this paper is to determine the structure of Cayley graph of dihedral groups D2n of order 2n when n = p or 2p2, where p is an odd prime number. The graph structures are based on circulant graphs with suitable jumps.
Full text article
References
A. Abdollahi, S. Akbari, and H. R. Maimani, “Non-commuting graph of a group,” Journal of Algebra, vol. 298, pp. 468–492, 2006. https://doi.org/10.1016/j.jalgebra.2006.02.015.
D. Bundy, “The connectivity of commuting graphs,” Journal of Combinatorial Theory, Series A, vol. 113, pp. 995–1007, 2006. https://doi.org/10.1016/j.jcta.2005.09.003.
S. Akbari and A. Mohammadian, “Zero-divisor graphs of non-commutative rings,” Journal of Algebra, vol. 296, pp. 462–479, 2006. https://doi.org/10.1016/j.jalgebra.2005.07.007.
S. Alkaseabe and A. Erfanian, “The structure of Cayley graphs of dihedral groups of valencies 1, 2 and 3,” Proyecciones (Antofagasta), vol. 40, no. 6, pp. 1683–1691, 2021. http://dx.doi.org/10.22199/issn.0717-6279-4357-4429.
L. Babai, “Automorphism groups, isomorphism, reconstruction,” in Handbook of Combinatorics, pp. 1447–1540, Cambridge, MA: MIT Press, 1996. https://dl.acm.org/doi/abs/10.5555/896082.
V. Bafna and P. A. Pevzner, “Genome rearrangements and sorting by reversals,” SIAM Journal on Computing, vol. 25, pp. 272–289, 1996. https://doi.org/10.1137/S0097539793250627.
A. Cayley, “The theory of groups: Graphical representation,” American Journal of Mathematics, vol. 1, no. 2, pp. 174–176, 1878.
G. Erskine, “Diameter 2 Cayley graphs of dihedral groups,” Discrete Mathematics, vol. 338, no. 6, pp. 1022–1024, 2015. https://doi.org/10.1016/j.disc.2015.01.023.
X. Gui Fang, C. Heng Li, and M. Yao Xu, “On edge-transitive Cayley graphs of valency four,” European Journal of Combinatorics, vol. 25, no. 7, pp. 1107–1116, 2004. https://doi.org/10.1016/j.ejc.2003.07.008.
A. Kelarev, J. Ryan, and J. Yearwood, “Cayley graphs as classifiers for data mining: The influence of asymmetries,” Discrete Mathematics, vol. 309, pp. 5360–5369, 2009. https://doi.org/10.1016/j.disc.2008.11.030.
C. H. Li, “On isomorphisms of finite graphs - A survey,” Discrete Mathematics, vol. 256, pp. 301–334, 2002. https://doi.org/10.1016/S0012-365X(01)00438-1.
L. Lu, Q. Huang, and X. Huang, “Integral Cayley graphs over dihedral groups,” Journal of Algebraic Combinatorics, vol. 47, pp. 585–601, 2018. https://link.springer.com/article/10.1007/s10801-017-0787-x.
S. Miklaviˇc and P. Potoˇcnik, “Distance-regular Cayley graphs on dihedral groups,” Journal of Combinatorial Theory, Series B, vol. 97, pp. 14–33, 2007. https://doi.org/10.1016/j.jctb.2006.03.003.
J. Pan, “Locally primitive Cayley graphs of dihedral groups,” European Journal of Combinatorics, vol. 36, pp. 39–52, 2014. https://doi.org/10.1016/j.ejc.2013.06.041.
D. B. West, Introduction to Graph Theory. USA: Prentice Hall, 2nd ed., 2001.
D. J. S. Robinson, A Course in the Theory of Groups. New York: Springer-Verlag, 1982.
Authors
Copyright (c) 2025 Journal of the Indonesian Mathematical Society
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Article Details
