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




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 nullityRelation between the nullity of a graph and its matching numberGraphs 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 verticesThe nullity of a graph with fractional matching numberRelation between the inertia indices of a complex unit gain graph and those of its underlying graphOn connected signed graphs with rank equal to girthThe rank of a signed graphAn upper bound of the nullity of a graph in terms of order and maximum degreeProof of a conjecture on the nullity of a connected graph in terms of order and maximum degreeOn the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graphThe rank of a complex unit gain graph in terms of the matching numberNullities of graphs with given order, matching number and cyclomatic number revisitedOn the relation between theH-rank of a mixed graph and the matching number of its underlying graphThe rank of a signed graph in terms of the rank of its underlying graphThe rank of a complex unit gain graph in terms of the rank of its underlying graphProof of a conjecture on the nullity of a graphA survey of the maximal and the minimal nullity in terms of omega invariant on graphsLine graphs of trees with the largest eigenvalue multiplicityUnnamed ItemUnnamed ItemAn improved lower bound for the nullity of a graph in terms of matching numberBounds for the rank of a complex unit gain graph in terms of its maximum degreeRelation between the \(H\)-rank of a mixed graph and the rank of its underlying graphNo 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 graphNo graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)The extremal graphs with respect to their nullityUpper bounds of the energy of triangle-free graphs in terms of matching numberNullity of a graph in terms of path cover numberThe 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 verticesA sharp upper bound of the nullity of a connected graph in terms of order and maximum degreeSkew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph




Cites Work




This page was built for publication: A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)