Some properties of commuting graphs of finite n-centralizer groups
Subject Areas : AlgebraZeinab Foruzanfar 1 , Mehdi Rezaei 2 *
1 - Buein Zahra Technical University
2 - Buein Zahra Technical University
Keywords: n-مرکزساز, گراف جابجایی, عنصر نامرکزی, طیف لاپلاسین,
Abstract :
Let G be a finite non-abelian group and Z(G) the center of G . The commuting graph of G , denoted by Γ_G , is a simple undirected graph whose vertex set is G-Z(G) and two distinct vertices x and y are adjacent if and only if xy=yx . We say that a group G is n - centralizer if the number of distinct centralizers of its elements is n. Also, a finite non-abelian group G is called an AC-group if C_G(x) is abelian for any x ϵG-Z(G) . The spectrum of a graph is the set of distinct eigenvalues with their multiplicities of the adjacency matrix of the graph. Similarly, the Laplacian spectrum of a graph is the set of distinct eigenvalues with their multiplicities of the Laplacian matrix of the graph. Also, the set of distinct eigenvalues with their multiplicities of the signless Laplacian matrix of the graph is called the signless Laplacian spectrum of the graph. In this paper, we show that the finite 6-centralizers and 7-centralizers groups are AC-group. Moreover, the spectrum, Laplacian spectrum and signless Laplacian spectrum of commuting graphs of these groups are computed.
[1] A. Abdollahi, S. M. Jafarian Amiri, A. Mohammadi Hassanabadi, “Groups with specific number of centralizers,” Houston J. Math., vol. 33, no. 1, pp. 43-57, 2007.
[2] A. Ashrafi, “Counting the centralizers of some finite groups,” Korean J. Comput. Appl. Math., vol. 7, no. 1, pp. 115-124, 2000.
[3] S. J. Baishya, “On finite groups with specific number of centralizers,” Int. Electron. J. Algebra, vol. 13, pp. 53-62, 2013.
[4] S. Belcastro, G. Sherman, “Counting centralizers in finite groups,” Math. Mag., vol. 67, no. 5, pp. 366-374, 1994.
[5] N. Biggs, “Algebraic graph theory,” New York: Cambridge University Press, 1994.
[6] R. Brauer, K. A. Fowler, “On groups of even order,” Ann. Math., vol. 62, no. 2, pp. 565-583, 1955.
[7] J. Dutta, R. K. Nath, “Spectrum of commuting graphs of some classes of finite groups,” Matematika, vol. 33, no. 1, pp. 87-95, 2017.
[8] B. Mohar, “The Laplacian spectrum of graphs, in graph theory, combinatorics, and applications,” In Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University, Kalamazoo, 1988, (Edited by Y. Alavi, G. Chartrand, O. R. Oellermann and A. J. Schwenk), pp. 871-898, Wiley, New York, 1991.
[9] R. K. Nath, “Various spectra of commuting graphs n-centralizer finite groups,” Int. J. Eng. Sci. Tech., vol. 10, pp. 170-172, 2018.
[10] M. J. Tomkinson, “Groups covered by finitely many cosets or subgroups,” Comm. Algebra, vol. 15, pp. 845-859, 1987.