The following pages link to Trees with maximum nullity (Q1774973):
Displayed 50 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)
- A characterization of graphs with rank 5 (Q414705) (← links)
- On the nullity of the line graph of unicyclic graph with depth one (Q448347) (← links)
- A characterization of graphs with rank 4 (Q630525) (← links)
- On the nullity of tricyclic graphs (Q630526) (← links)
- On the nullity of a graph with cut-points (Q648933) (← links)
- On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) (Q820992) (← links)
- On the nullity and the matching number of unicyclic graphs (Q837008) (← links)
- On the nullity of bicyclic graphs (Q947600) (← links)
- On the nullity of graphs with pendent vertices (Q947624) (← links)
- Tree decomposition by eigenvectors (Q958004) (← links)
- An upper bound of the nullity of a graph in terms of order and maximum degree (Q1654407) (← links)
- Null decomposition of trees (Q1690257) (← links)
- A note on the nullity of unicyclic signed graphs (Q1931729) (← links)
- Positive and negative inertia index of a graph (Q1932609) (← links)
- The nullity of \((k-1)\)-cyclic graphs (Q1940108) (← links)
- The multiplicities of eigenvalues of a graph (Q2079150) (← links)
- Nullity and singularity of a graph in which every block is a cycle (Q2124640) (← links)
- A linear time algorithm for the nullity of vertex-weighted block graphs (Q2161234) (← links)
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree (Q2174420) (← links)
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph (Q2174466) (← links)
- Nonsingular (vertex-weighted) block graphs (Q2185844) (← links)
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities (Q2229485) (← links)
- Nullspace vertex partition in graphs (Q2230734) (← links)
- On the nullity of a connected graph in terms of order and maximum degree (Q2244875) (← links)
- The leaf-free graphs with nullity \(2 c ( G ) - 1\) (Q2306583) (← links)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices (Q2332431) (← links)
- On the null-spaces of acyclic and unicyclic singular graphs (Q2383015) (← links)
- The positive and the negative inertia index of line graphs of trees (Q2435520) (← links)
- On the nullity of unicyclic graphs (Q2568370) (← links)
- On the nullity of a family of tripartite graphs (Q2629570) (← links)
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822) (← links)
- The signature of<i>k</i>-cyclic graphs of ∞-type (Q2787602) (← links)
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree (Q2805690) (← links)
- ON THE NULL-SPACES OF BICYCLIC SINGULAR GRAPHS (Q3007768) (← links)
- Minimizing the Laplacian spectral radius of trees with given matching number (Q3422771) (← links)
- The nullity of<i>k</i>-cyclic graphs of ∞-type (Q3455677) (← links)
- Minimal configuration unicyclic graphs (Q3600665) (← links)
- Minimal configuration bicyclic graphs (Q4908174) (← links)
- Nullity of a graph in terms of path cover number (Q4959297) (← links)
- On the nullity number of graphs (Q5006628) (← links)
- On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices (Q5049197) (← links)
- The minimal Laplacian spectral radius of trees with given matching number (Q5409954) (← links)
- The nullity of bicyclic signed graphs (Q5409957) (← links)
- On the nullity of bipartite graphs (Q5902038) (← links)
- On the nullity of bipartite graphs (Q5902319) (← links)
- On the nullity of graphs with pendant trees (Q5962289) (← links)
- The extremal graphs with respect to their nullity (Q5964879) (← links)