The following pages link to (Q3166853):
Displaying 15 items.
- Characterization of graphs with given order, given size and given matching number that minimize nullity (Q271637) (← links)
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices (Q323069) (← links)
- Characterization of graphs whose signature equals the number of odd cycles (Q331171) (← links)
- On the nullity of the line graph of unicyclic graph with depth one (Q448347) (← links)
- On acyclic and unicyclic graphs whose minimum rank equals the diameter (Q947619) (← links)
- An upper bound of the nullity of a graph in terms of order and maximum degree (Q1654407) (← links)
- Maximum order of trees and bipartite graphs with a given rank (Q1759390) (← links)
- A characterization of long graphs of arbitrary rank (Q1931744) (← links)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices (Q2332431) (← links)
- The positive and the negative inertia index of line graphs of trees (Q2435520) (← links)
- On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis (Q3476831) (← links)
- Nullity of a graph in terms of path cover number (Q4959297) (← links)
- An improved lower bound for the nullity of a graph in terms of matching number (Q5132620) (← links)
- Proof of a conjecture on the nullity of a graph (Q6134647) (← links)
- Line graphs of trees with the largest eigenvalue multiplicity (Q6178770) (← links)
