The following pages link to On the nullity of graphs (Q3497871):
Displaying 50 items.
- 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 \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\) (Q471950) (← links)
- Per-spectral characterizations of graphs with extremal per-nullity (Q491098) (← links)
- Bounds of graph energy in terms of vertex cover number (Q503428) (← links)
- Mixed graphs with \(H\)-rank 3 (Q526283) (← 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 the relationship between the skew-rank of an oriented graph and the rank of its underlying graph (Q725520) (← links)
- On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) (Q820992) (← links)
- Some graphs determined by their spectra (Q840642) (← links)
- Maximum generic nullity of a graph (Q846315) (← links)
- On the nullity of graphs with pendent vertices (Q947624) (← links)
- Graphs whose positive semi-definite matrices have nullity at most two (Q1414690) (← links)
- New lower bounds for the Randić spread (Q1638000) (← links)
- An upper bound of the nullity of a graph in terms of order and maximum degree (Q1654407) (← links)
- The rank of a signed graph in terms of the rank of its underlying graph (Q1680298) (← links)
- Further results on the nullity of signed graphs (Q1714621) (← links)
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph (Q1732760) (← links)
- Lower bounds of graph energy in terms of matching number (Q1747123) (← links)
- On the nullspace of arc-transitive graphs over finite fields (Q1759334) (← links)
- A note on the nullity of unicyclic signed graphs (Q1931729) (← links)
- A characterization of long graphs of arbitrary rank (Q1931744) (← links)
- Positive and negative inertia index of a graph (Q1932609) (← links)
- The nullity of \((k-1)\)-cyclic graphs (Q1940108) (← links)
- Relationship between the rank and the matching number of a graph (Q2011117) (← links)
- Graphs whose distance matrix has at most three negative eigenvalues (Q2013202) (← links)
- A relation between a vertex-degree-based topological index and its energy (Q2069866) (← links)
- The multiplicities of eigenvalues of a graph (Q2079150) (← links)
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs (Q2099490) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- Graphs with nullity \(2c(G)+p(G)-1\) (Q2113337) (← links)
- Graphs \(G\) with nullity \(n(G) - g(G) -1\) (Q2133682) (← links)
- On connected signed graphs with rank equal to girth (Q2158277) (← links)
- On the rank of the distance matrix of graphs (Q2161884) (← links)
- Complex unit gain graphs of rank 2 (Q2174098) (← links)
- On the characterization of digraphs with given rank (Q2174415) (← 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)
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities (Q2229485) (← links)
- On the nullity of a connected graph in terms of order and maximum degree (Q2244875) (← links)
- Characterization of graphs with an eigenvalue of large multiplicity (Q2246527) (← links)
- Characterization of oriented graphs of rank 2 (Q2272483) (← links)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices (Q2332431) (← links)
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree (Q2332433) (← links)
- The rank of a complex unit gain graph in terms of the rank of its underlying graph (Q2424827) (← links)
- The inertia of weighted unicyclic graphs (Q2442434) (← links)
- On the nullity of a family of tripartite graphs (Q2629570) (← links)
- Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture (Q2659187) (← links)
