Relation between the nullity of a graph and its matching number

DOI10.1016/J.DAM.2022.01.020zbMath1491.05129OpenAlexW4221030474MaRDI QIDQ833002

Dein Wong, Fenglei Tian, Qi Zhou

Publication date: 28 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.020

zbMATH Keywords

matching numbernullityeigenvalue multiplicity

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) Connectivity (05C40)

Related Items (1)

The rank of a signed graph

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• Spectra of graphs
• Spektren endlicher Grafen
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• An improved lower bound for the nullity of a graph in terms of matching number
• On the nullity of line graphs of trees

This page was built for publication: Relation between the nullity of a graph and its matching number