Skew-rank of an oriented graph in terms of matching number

From MaRDI portal
Publication:5962847

DOI10.1016/j.laa.2016.01.036zbMath1331.05181OpenAlexW2258430117MaRDI QIDQ5962847

Xiaobin Ma, Dein Wong, Fenglei Tian

Publication date: 24 February 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.01.036




Related Items (39)

Relation between the inertia indices of a complex unit gain graph and those of its underlying graphAn 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 relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graphComplex unit gain graphs of rank 2On the characterization of digraphs with given rankRelations between the inertia indices of a mixed graph and those of its underlying graphThe rank of a complex unit gain graph in terms of the matching numberCharacterizing the extremal graphs with respect to the eccentricity spectral radius, and beyondOn 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 graphUpper bound of skew energy of an oriented graph in terms of its skew rankBounds for the matching number and cyclomatic number of a signed graph in terms of rankSpectral norm of oriented graphsSkew-rank of an oriented graph and independence number 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 graphRelation between the trace norm of an oriented graph and its rankOn the inertia index of a mixed graph in terms of the matching numberAn 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\)Energy, matching number and odd cycles of graphsRelationship between the rank and the matching number of a graphCharacterization of oriented graphs of rank 2On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphsRelation between the skew energy of an oriented graph and its matching numberRelation between the skew-rank of an oriented graph and the independence number of its underlying graphOn the relationship between the skew-rank of an oriented graph and the rank of its underlying graphNullity of a graph in terms of path cover numberBounds on the nullity, the H-rank and the Hermitian energy of a mixed graphRelation between the Hermitian energy of a mixed graph and the matching number of its underlying graphAdjacency rank and independence number of a signed graphThe leaf-free graphs with nullity \(2 c ( G ) - 1\)The 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 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 graph



Cites Work


This page was built for publication: Skew-rank of an oriented graph in terms of matching number