A note on nullity of a reduced bipartite graph in terms of independent number.

MaRDI QIDQ5206326zbMATH OpenFDO

Authors

Publication date 18 December 2019

zbMATH Keywords

independent numbermaximum degreenullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• An upper bound for the nullity of a bipartite graph in terms of its maximum degree
• Bounds for the nullity of a graph in terms of the matching number and the independence number
• An improved lower bound for the nullity of a graph in terms of matching number
• On the nullity of bipartite graphs
• On the nullity of bipartite graphs

Cited in

(3)

• An upper bound for the nullity of a bipartite graph in terms of its maximum degree
• Bounds for the nullity of a graph in terms of the matching number and the independence number
• A matching-minor monotone parameter for bipartite graphs

This page was built for publication: A note on nullity of a reduced bipartite graph in terms of independent number.

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