On the Spectra of Strong Power Graphs of Finite Groups  

作　　者：Ruiqin FU Xuanlong MA 

机构地区：[1]School of Science, Xi’an Shiyou University

出　　处：《Journal of Mathematical Research with Applications》2019年第5期453-458,共6页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant No.11801441);the Scientific Research Program Funded by Shaanxi Provincial Education Department(Program No.18JK0623);the Natural Science Foundation of Shaanxi Province(Grant No.2019JQ-056)

摘　　要：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 x^n1 = y^n2 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.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.

关 键 词：strong POWER graph CYCLIC group characteristic POLYNOMIAL spectrum 

分 类 号：O1[理学—数学]