Spectral characterization of a specific class of trees
classification
🧮 math.CO
keywords
spectrumadjacencycharacterizationclasscospectraldeterminedgraphgraphs
read the original abstract
In this paper, it is shown that the graph $T_4(p,q,r)$ is determined by its Laplacian spectrum and there are no two non-isomorphic such graphs which are cospectral with respect to adjacency spectrum.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.