Proof of a conjecture on the nullity of a graph
From MaRDI portal
Publication:6134647
DOI10.1002/JGT.22578zbMATH Open1525.05120OpenAlexW3026388948WikidataQ123254424 ScholiaQ123254424MaRDI QIDQ6134647
Publication date: 22 August 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22578
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07)
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?)
- Matrix Analysis
- Spectra of graphs
- 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 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
- On the nullity of graphs
- 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
- An upper bound of the nullity of a graph in terms of order and maximum degree
- 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 (7)
- On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)
- From the editor-in-chief
- The gap between the rank of a complex unit gain graph and its underlying graph
- On connected signed graphs with rank equal to girth
- 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
This page was built for publication: Proof of a conjecture on the nullity of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134647)