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.025zbMATH Open1395.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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix Analysis
- 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
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- 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)\)
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- 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
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- The rank of a signed graph in terms of the rank of its underlying graph
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
Cited In (27)
- On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)
- Proof of a conjecture on the nullity of a graph
- 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
- From the editor-in-chief
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- A short proof of Zhou, Wong and Sun's conjecture
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Line graphs of trees with the largest eigenvalue multiplicity
- The gap between the rank of a complex unit gain graph and its underlying graph
- Nullity of a graph in terms of path cover number
- On connected signed graphs with rank equal to girth
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- On the nullity of a connected graph in terms of order and maximum degree
- Title not available (Why is that?)
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
- Upper bound of skew energy of an oriented graph in terms of its skew rank
- An improved lower bound for the nullity of a graph in terms of matching number
- On the relation between the positive inertia index and negative inertia index of weighted graphs
This page was built for publication: An upper bound of the nullity of a graph in terms of order and maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654407)
