Author(s)

Jianxuan Luo

School of Mathematics and Statistics, Qinghai Minzu University, Xining, China.

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

Luo, J. (2023) On the Spectral Properties of Graphs with Rank 4. Applied Mathematics, 14, 748-763. doi: 10.4236/am.2023.1411045.