Graph transformations which preserve the multiplicity of an eigenvalue

DOI10.1016/0166-218X(95)00021-IMaRDI QIDQ1917342zbMATH OpenFDO

Authors Yeong-Nan Yeh, Ivan Gutman, Chin-Mei Fu

Publication date 7 July 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(95)00021-I

zbMATH Keywords

eigenvaluegraph transformations

Mathematics Subject Classification ID

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

Review text

Some results about graph transformations that preserve the multiplicity of a zero eigenvalue of the graph are generalized for eigenvalues of the form \(2\cos r\pi\), where \(r\) is a rational number with \(0< r< 1\).

Recommendations

• The change in multiplicity of an eigenvalue due to adding or removing edges
• A note on the multiplicities of graph eigenvalues
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• Topological approach to the chemistry of conjugated molecules

Cited in

(5)

• Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
• Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
• A characterization of graphs with rank 5
• A characterization of graphs with rank 4
• On the nullity and the matching number of unicyclic graphs

This page was built for publication: Graph transformations which preserve the multiplicity of an eigenvalue

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