strong power graph;
cyclic group;
characteristic polynomial;
spectrum;
D O I:
暂无
中图分类号:
O152.1 [有限群论];
O157.5 [图论];
学科分类号:
摘要:
Let G be a finite group of order n. The strong power graph of G is the undirected graph whose vertex set is G and two distinct vertices x and y are adjacent if xn1= yn2 for some positive integers n1, n2 < n. In this paper, we give the characteristic polynomials of the distance and adjacency matrix of the strong power graph of G, and compute its distance and adjacency spectrum.
机构:
Beijing Normal Univ, Sch Math Sci, Lab Math & Complex Syst MOE, Beijing 100875, Peoples R ChinaXian Shiyou Univ, Sch Sci, Xian 710065, Peoples R China
机构:
Department of Mathematics, National Institute of Technology Calicut, Kerala, Calicut,673601, IndiaDepartment of Mathematics, National Institute of Technology Calicut, Kerala, Calicut,673601, India
Swathi, V.V.
Sunitha, M.S.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics, National Institute of Technology Calicut, Kerala, Calicut,673601, IndiaDepartment of Mathematics, National Institute of Technology Calicut, Kerala, Calicut,673601, India