Characterization of Graphs with an Eigenvalue of Large Multiplicity
Sign Up to like & getrecommendations! Published in 2020 at "Advances in Mathematical Physics"
DOI: 10.1155/2020/3054672
Abstract: Let be a simple and undirected graph. The eigenvalues of the adjacency matrix of are called the eigenvalues of . In this paper, we characterize all the - vertex graphs with some eigenvalue of multiplicity… read more here.
Keywords: graphs; characterization graphs; graphs eigenvalue; eigenvalue large ... See more keywords
Spectral Invariants and Their Application on Spectral Characterization of Graphs
Sign Up to like & getrecommendations! Published in 2022 at "Axioms"
DOI: 10.3390/axioms11060260
Abstract: In this paper, we give a method to characterize graphs determined by their adjacency spectrum. At first, we give two parameters Π1(G) and Π2(G), which are related to coefficients of the characteristic polynomial of graph… read more here.
Keywords: spectral characterization; graphs; application spectral; spectral invariants ... See more keywords