An upper bound for the nullity of a bipartite graph in terms of its maximum degree

DOI10.1080/03081087.2015.1072530zbMATH Open1335.05115OpenAlexW1540182972MaRDI QIDQ2805690FDOQ2805690

Ya-Zhi Song, Xiaoqiu Song, Mingcui Zhang

Publication date: 12 May 2016

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2015.1072530

Recommendations

• A note on nullity of a reduced bipartite graph in terms of independent number.
• An upper bound of the nullity of a graph in terms of order and maximum degree
• On the nullity of bipartite graphs
• On the nullity of a connected graph in terms of order and maximum degree
• On the nullity of bipartite graphs

zbMATH Keywords

rankmaximum degreenullityreduced graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• Trees with maximum nullity
• A characterization of long graphs of arbitrary rank
• On the nullity of unicyclic graphs
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• A characterization of graphs with rank 5
• On the nullity of the line graph of unicyclic graph with depth one
• On the nullity of bipartite graphs
• On the nullity of bipartite graphs
• On the nullity of line graphs of trees
• A characterization of graphs with rank 4
• On the nullity of tricyclic graphs
• Spektren endlicher Grafen
• On the nullity and the matching number of unicyclic graphs
• On the nullity of bicyclic graphs
• On the nullity of graphs with pendant trees

Cited In (13)

• Proof of a conjecture on the nullity of a graph
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• An upper bound of the nullity of a graph in terms of order and maximum degree
• On the nullity of bipartite graphs
• On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
• Line graphs of trees with the largest eigenvalue multiplicity
• Nullity of a graph in terms of path cover number
• Relationship between the rank and the matching number of a graph
• The multiplicities of eigenvalues of a graph
• On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices
• On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
• An improved lower bound for the nullity of a graph in terms of matching number

This page was built for publication: An upper bound for the nullity of a bipartite graph in terms of its maximum degree

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