The spectral characterization of graphs of index less than 2 with no path as a component

DOI10.1016/J.LAA.2007.10.012MaRDI QIDQ2477545zbMATH OpenOpenAlexFDO

Authors G. R. Omidi

Publication date 14 March 2008

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2007.10.012

zbMATH Keywords

cospectral graphsLaplacian matrixspectra of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• The spectral characterization of graphs of index less than 2 with no Z_n as a component.
• On a Laplacian spectral characterization of graphs of index less than 2
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Spectral characterization of the complete graph removing a path of small length
• The spectral radius of graphs without paths and cycles of specified length
• On the spectral characterization of G-graph
• On the spectral characterizations of graphs
• Spectral characterization of the complete graph removing a path
• The spectral characterization of \(\infty\)-graphs
• Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2.

Cites work

• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• scientific article; zbMATH DE number 3480646 (Why is no real title available?)
• scientific article; zbMATH DE number 3512165 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• On the Laplacian eigenvalues of a graph
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Starlike trees are determined by their Laplacian spectrum
• The \(T\)-shape tree is determined by its Laplacian spectrum
• Which graphs are determined by their spectrum?

Cited in

(16)

• A note on the spectral characterization of \(\theta \)-graphs
• Spectral characterizations of sandglass graphs
• The spectral characterization of graphs of index less than 2 with no Z_n as a component.
• On the spectral characterization of theta graphs
• Two-dimensional fracture mechanics problems for solids with sharp and rounded V-notches
• Constructing graphs with given spectrum and the spectral radius at most 2
• A factor of non-DS graphs
• Spectral determination of graphs whose components are paths and cycles
• On the spectral characterization of the union of complete multipartite graph and some isolated vertices
• Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
• Spectral characterization of graphs whose second largest eigenvalue is less than 1
• A note on the spectral characterization of dumbbell graphs
• Spectral characterization of the complete graph removing a path
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• On a Laplacian spectral characterization of graphs of index less than 2
• The cospectral equivalence classes of graphs having an isolated vertex

This page was built for publication: The spectral characterization of graphs of index less than 2 with no path as a component

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477545)