Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices

From MaRDI portal
Publication:323069


DOI10.1016/j.dam.2016.07.010zbMath1346.05144OpenAlexW2493319874MaRDI QIDQ323069

Fenglei Tian, Dein Wong, Xiaobin Ma

Publication date: 7 October 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.07.010



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\), 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, An upper bound of the nullity of a graph in terms of order and maximum degree, Bounds for the rank of a complex unit gain graph in terms of the independence number, 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, Bounds for the matching number and cyclomatic number of a signed graph in terms of rank, Nullities of cycle-spliced bipartite graphs, 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, On the inertia index of a mixed graph in terms of the matching number, Line graphs of trees with the largest eigenvalue multiplicity, A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices, Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices, On connected \(\mathbb{T}\)-gain graphs with rank equal to girth, 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, Relationship between the rank and the matching number of a graph, On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs, Relation between the skew-rank of an oriented graph and the independence number of its underlying graph, Nullity of a graph in terms of path cover number, The leaf-free graphs with nullity \(2 c ( G ) - 1\), On the multiplicity of \(\alpha\) as an eigenvalue of the \(a_\alpha\) matrix of a graph in terms of the number of pendant vertices, The relation between the H-rank of a mixed graph and the independence number of its underlying graph, Relation between the rank of a signed graph and the rank of its underlying graph, Graphs \(G\) with nullity \(2c(G) + p(G) - 1\), The multiplicities of eigenvalues of a graph, The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices, Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph, Graphs with nullity \(2c(G)+p(G)-1\)



Cites Work