The multiplicity of nonzero eigenvalues and the induced matching number of a graph

DOI10.1016/J.DISC.2025.114762MaRDI QIDQ6884401zbMATH OpenFDO

Authors Qian-Qian Chen, Jiming Guo

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114762

zbMATH Keywords

eigenvalue multiplicityinduced matching numbermatching number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• A relation between multiplicity of nonzero eigenvalues of trees and their matching numbers
• An improved lower bound for the nullity of a graph in terms of matching number
• An introduction to the theory of graph spectra
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• On multiple eigenvalues of trees
• Relation between the nullity of a graph and its matching number

This page was built for publication: The multiplicity of nonzero eigenvalues and the induced matching number of a graph

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