Finite group;
power graph;
Laplacian spectrum;
CONNECTIVITY;
D O I:
10.1142/S1793557122500267
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
The power graph G(S) of a semigroup S is a simple undirected graph whose vertex set is S itself, and any two distinct vertices are adjacent if one of them is a power of the other. In this paper, we describe the power graph G(Z(p)(r) x Z(p2)(s)) in terms of joins and disjoint unions of complete graphs, and use this to calculate the Laplacian polynomial of G(Z(p)(r) x Z(p2)(s)). We finally calculate the Laplacian polynomial of the power graph g(Z(pm)(n)).
机构:
Univ Prasetiya Mulya, Sch Appl Stem, Business Math Dept, South Tangerang 15339, IndonesiaUniv Prasetiya Mulya, Sch Appl Stem, Business Math Dept, South Tangerang 15339, Indonesia
Steven
Hoseana, Jonathan
论文数: 0引用数: 0
h-index: 0
机构:
Parahyangan Catholic Univ, Dept Math, Bandung 40141, IndonesiaUniv Prasetiya Mulya, Sch Appl Stem, Business Math Dept, South Tangerang 15339, Indonesia