Graphs with nullity \(2c(G)+p(G)-1\)

DOI10.1016/j.disc.2021.112786zbMath1486.05190OpenAlexW4205676416MaRDI QIDQ2113337

Yanyan Li

Publication date: 14 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112786

zbMATH Keywords

nullityeigenvalue multiplicity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (6)

Nullities of cycle-spliced bipartite graphs ⋮ A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices ⋮ Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices ⋮ On connected \(\mathbb{T}\)-gain graphs with rank equal to girth ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• On the nullity of a graph with cut-points
• Spectra of graphs
• Spektren endlicher Grafen
• The leaf-free graphs with nullity \(2 c ( G ) - 1\)
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
• On the nullity of line graphs of trees
• On the nullity of graphs with pendant trees

This page was built for publication: Graphs with nullity \(2c(G)+p(G)-1\)