The Laplacian Spectral Characterization of Graph G_6(p,q)
Abstract：A connected bipartite graph with fourth Laplacian eigenvalue less than 2 and vertices no less than 4 must be the connected subgraph of G_6(p,q),G_8(p,q,r),G_9(p,q,r).Tree,as a special case of bipartite graph,has fine properties.This paper studies the specific form of trees with fourth Laplacian eigenvalue less than 2 and Laplacian characteristic polynomial.By comparing the characteristic polynomial coefficient, it is proved that G_6(p,q) is determined by its Laplacian eigenvalues.
Keywords：eigenvalueLaplacian spectrumtreecharacteristic polynomialcospectral graphs
Publication Date：2012-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 271-274,277 )