On the Spectral Properties of Graphs with Rank 4  

作　　者：Jianxuan Luo Jianxuan Luo(School of Mathematics and Statistics, Qinghai Minzu University, Xining, China)

机构地区：[1]School of Mathematics and Statistics, Qinghai Minzu University, Xining, China

出　　处：《Applied Mathematics》2023年第11期748-763,共16页应用数学（英文）

摘　　要：Let G be a graph and A(G) the adjacency matrix of G. The spectrum of G is the eigenvalues together with their multiplicities of A(G). Chang et al. (2011) characterized the structures of all graphs with rank 4. Monsalve and Rada (2021) gave the bound of spectral radius of all graphs with rank 4. Based on these results as above, we further investigate the spectral properties of graphs with rank 4. And we give the expressions of the spectral radius and energy of all graphs with rank 4. In particular, we show that some graphs with rank 4 are determined by their spectra.Let G be a graph and A(G) the adjacency matrix of G. The spectrum of G is the eigenvalues together with their multiplicities of A(G). Chang et al. (2011) characterized the structures of all graphs with rank 4. Monsalve and Rada (2021) gave the bound of spectral radius of all graphs with rank 4. Based on these results as above, we further investigate the spectral properties of graphs with rank 4. And we give the expressions of the spectral radius and energy of all graphs with rank 4. In particular, we show that some graphs with rank 4 are determined by their spectra.

关 键 词：Spectral Radius ENERGY Cospectral Graphs RANK 

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