An upper bound for the nullity of a bipartite graph in terms of its maximum degree
From MaRDI portal
Publication:2805690
Recommendations
Cites work
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A characterization of long graphs of arbitrary rank
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of graphs with pendant trees
- On the nullity of line graphs of trees
- On the nullity of the line graph of unicyclic graph with depth one
- On the nullity of tricyclic graphs
- On the nullity of unicyclic graphs
- Spektren endlicher Grafen
- Trees with maximum nullity
Cited in
(17)- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Relationship between the rank and the matching number of a graph
- Line graphs of trees with the largest eigenvalue multiplicity
- Proof of a conjecture on the nullity of a graph
- The multiplicities of eigenvalues of a graph
- An upper bound of the nullity of a graph in terms of order and maximum degree
- A note on nullity of a reduced bipartite graph in terms of independent number.
- Nullity of a graph in terms of path cover number
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- An improved lower bound for the nullity of a graph in terms of matching number
- 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
- On the nullity of a connected graph in terms of order and maximum degree
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
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)