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 (42)

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 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 girthAn upper bound of the nullity of a graph in terms of order and maximum degreeBounds for the rank of a complex unit gain graph in terms of the independence numberOn 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 graphBounds for the matching number and cyclomatic number of a signed graph in terms of rankNullities of cycle-spliced bipartite graphsThe 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 graphsOn the inertia index of a mixed graph in terms of the matching numberLine graphs of trees with the largest eigenvalue multiplicityA characterization of trees with eigenvalue multiplicity one less than their number of pendant verticesEigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant verticesOn connected \(\mathbb{T}\)-gain graphs with rank equal to girthUnnamed 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 graphRelationship between the rank and the matching number of a graphOn the characteristic polynomials and \(H\)-ranks of the weighted mixed graphsRelation between the skew-rank of an oriented graph and the independence number of its underlying graphNullity of a graph in terms of path cover numberThe 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 verticesThe relation between the H-rank of a mixed graph and the independence number of its underlying graphRelation between the rank of a signed graph and the rank of its underlying graphGraphs \(G\) with nullity \(2c(G) + p(G) - 1\)The multiplicities of eigenvalues of a graphThe multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant verticesSkew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graphGraphs with nullity \(2c(G)+p(G)-1\)



Cites Work


This page was built for publication: Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices