A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
From MaRDI portal
Publication:471950
DOI10.1016/J.LAA.2014.09.034zbMath1303.05158OpenAlexW2001156667MaRDI QIDQ471950
Bit-Shun Tam, Xiao-Qiu Song, Ya-Zhi Song
Publication date: 17 November 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.09.034
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (37)
On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) ⋮ Characterization of graphs with given order, given size and given matching number that minimize nullity ⋮ Relation between the nullity of a graph and its matching number ⋮ Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\) ⋮ Graphs \(G\) with nullity \(n(G) - g(G) -1\) ⋮ On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices ⋮ The nullity of a graph with fractional matching number ⋮ 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 ⋮ The rank of a signed graph ⋮ An upper bound of the nullity of a graph in terms of order and maximum degree ⋮ 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 ⋮ The rank of a complex unit gain graph in terms of the matching number ⋮ Nullities of graphs with given order, matching number and cyclomatic number revisited ⋮ On the relation between theH-rank of a mixed graph and the matching number of its underlying graph ⋮ The rank of a signed graph in terms of the rank of its underlying graph ⋮ The rank of a complex unit gain graph in terms of the rank of its underlying graph ⋮ Proof of a conjecture on the nullity of a graph ⋮ A survey of the maximal and the minimal nullity in terms of omega invariant on graphs ⋮ Line graphs of trees with the largest eigenvalue multiplicity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An improved lower bound for the nullity of a graph in terms of matching number ⋮ 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 ⋮ No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\) ⋮ Relationship between the rank and the matching number of a graph ⋮ No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\) ⋮ The extremal graphs with respect to their nullity ⋮ Upper bounds of the energy of triangle-free graphs in terms of matching number ⋮ Nullity of a graph in terms of path cover number ⋮ The leaf-free graphs with nullity \(2 c ( G ) - 1\) ⋮ Graphs \(G\) with nullity \(2c(G) + p(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 ⋮ Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
Cites Work
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- 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
- On the nullity of graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)