An upper bound of the nullity of a graph in terms of order and maximum degree
From MaRDI portal
Publication:1654407
DOI10.1016/j.laa.2018.06.025zbMath1395.05105OpenAlexW2811294297MaRDI QIDQ1654407
Dein Wong, Qi Zhou, Dongqin Sun
Publication date: 8 August 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.06.025
Related Items
On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\), Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\), Graphs \(G\) with nullity \(n(G) - g(G) -1\), Relation between the inertia indices of a complex unit gain graph and those of its underlying graph, On connected signed graphs with rank equal to girth, Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree, On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph, A short proof of Zhou, Wong and Sun's conjecture, Upper bound of skew energy of an oriented graph in terms of its skew rank, On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph, Proof of a conjecture on the nullity of a graph, Line graphs of trees with the largest eigenvalue multiplicity, On the relation between the positive inertia index and negative inertia index of weighted graphs, Unnamed Item, An improved lower bound for the nullity of a graph in terms of matching number, From the editor-in-chief, Bounds for the rank of a complex unit gain graph in terms of its maximum degree, Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph, On the nullity of a connected graph in terms of order and maximum degree, On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs, Some mixed graphs with \(H\)-rank 4, 6 or 8, Nullity of a graph in terms of path cover number, Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph, The leaf-free graphs with nullity \(2 c ( G ) - 1\), The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices, A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- A characterization of graphs with rank 5
- On the nullity of the line graph of unicyclic graph with depth one
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- The rank of a signed graph in terms of the rank of its underlying graph
- Trees with maximum nullity
- A characterization of long graphs of arbitrary rank
- On the nullity of unicyclic graphs
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- Matrix Analysis
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- Skew-rank of an oriented graph in terms of matching number
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
