Relation between the nullity of a graph and its matching number

DOI10.1016/J.DAM.2022.01.020zbMATH Open1491.05129OpenAlexW4221030474MaRDI QIDQ833002FDOQ833002

Authors: Qi Zhou, Dein Wong, Fenglei Tian 

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

Recommendations

• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• An improved lower bound for the nullity of a graph in terms of matching number
• Bounds for the nullity of a graph in terms of the matching number and the independence number
• The nullity of bicyclic graphs in terms of their matching number

zbMATH Keywords

matching numbereigenvalue multiplicitynullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Spectra of graphs
• 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
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• Title not available (Why is that?)
• On the nullity of line graphs of trees
• Spektren endlicher Grafen
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
• An improved lower bound for the nullity of a graph in terms of matching number

Cited In (8)

• Characterization of graphs with given order, given size and given matching number that minimize nullity
• A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
• Bounds for the nullity of a graph in terms of the matching number and the independence number
• The rank of a signed graph
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• The nullity of a graph with fractional matching number
• On the nullity number of graphs
• An improved lower bound for the nullity of a graph in terms of matching number

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

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