Pages that link to "Item:Q2805690"
From MaRDI portal
The following pages link to An upper bound for the nullity of a bipartite graph in terms of its maximum degree (Q2805690):
Displayed 12 items.
- An upper bound of the nullity of a graph in terms of order and maximum degree (Q1654407) (← links)
- Relationship between the rank and the matching number of a graph (Q2011117) (← links)
- The multiplicities of eigenvalues of a graph (Q2079150) (← links)
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph (Q2174466) (← links)
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree (Q2228099) (← links)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices (Q2332431) (← links)
- Nullity of a graph in terms of path cover number (Q4959297) (← links)
- On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices (Q5049197) (← links)
- An improved lower bound for the nullity of a graph in terms of matching number (Q5132620) (← links)
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph (Q6098089) (← links)
- Proof of a conjecture on the nullity of a graph (Q6134647) (← links)
- Line graphs of trees with the largest eigenvalue multiplicity (Q6178770) (← links)