The following pages link to (Q5678898):
Displayed 50 items.
- Characterization of graphs with given order, given size and given matching number that minimize nullity (Q271637) (← links)
- Graph reduction techniques and the multiplicity of the Laplacian eigenvalues (Q277144) (← links)
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices (Q323069) (← 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)
- Integral trees with given nullity (Q501045) (← links)
- A characterization of graphs with rank 4 (Q630525) (← links)
- On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) (Q820992) (← links)
- Relation between the nullity of a graph and its matching number (Q833002) (← links)
- Some graphs determined by their spectra (Q840642) (← links)
- On the nullity of graphs with pendent vertices (Q947624) (← links)
- Tree decomposition by eigenvectors (Q958004) (← links)
- On the eigenvalues of distance powers of circuits (Q968986) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- The rank of a graph after vertex addition (Q1369345) (← links)
- On the construction of graphs of nullity one (Q1381857) (← links)
- New inequalities for network distance measures by using graph spectra (Q1630771) (← 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)
- Inertia of complex unit gain graphs (Q1664249) (← links)
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph (Q1732760) (← links)
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices (Q1754425) (← links)
- Trees with maximum nullity (Q1774973) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- Graph transformations which preserve the multiplicity of an eigenvalue (Q1917342) (← links)
- On the N-spectrum of oriented graphs (Q2053390) (← links)
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\) (Q2078839) (← links)
- The multiplicities of eigenvalues of a graph (Q2079150) (← links)
- Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue (Q2109070) (← links)
- Graphs with nullity \(2c(G)+p(G)-1\) (Q2113337) (← links)
- Nullity and singularity of a graph in which every block is a cycle (Q2124640) (← links)
- Graphs \(G\) with nullity \(n(G) - g(G) -1\) (Q2133682) (← links)
- The nullity of a graph with fractional matching number (Q2142661) (← links)
- The rank of a signed graph (Q2158295) (← links)
- A linear time algorithm for the nullity of vertex-weighted block graphs (Q2161234) (← links)
- Complex unit gain graphs of rank 2 (Q2174098) (← 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)
- A short proof of Zhou, Wong and Sun's conjecture (Q2174469) (← links)
- Nonsingular (vertex-weighted) block graphs (Q2185844) (← links)
- The non-negative spectrum of a digraph (Q2189212) (← links)
- Null decomposition of bipartite graphs without cycles of length 0 modulo 4 (Q2229480) (← 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)
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\) (Q2274086) (← links)
- Permanent, determinant, and rank of bi-block graphs (Q2297337) (← links)
- The leaf-free graphs with nullity \(2 c ( G ) - 1\) (Q2306583) (← links)
- Block-indifference graphs: characterization, structural and spectral properties (Q2328093) (← links)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices (Q2332431) (← links)