Relation between the skew-rank of an oriented graph and the rank of its underlying graph

From MaRDI portal
Publication:5964257

DOI10.1016/j.ejc.2015.12.005zbMath1331.05097OpenAlexW2204805700MaRDI QIDQ5964257

Xiaobin Ma, Dein Wong, Fenglei Tian

Publication date: 29 February 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.12.005




Related Items (40)

On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant verticesRelation 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 degreeOn 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 graphOn the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graphThe rank of a complex unit gain graph in terms of the matching numberOn 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 rankSpectral norm of oriented graphsInertia indices of a complex unit gain graph in terms of matching numberSkew-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 difference between the skew-rank of an oriented graph and the rank of its underlying graphLine graphs of trees with the largest eigenvalue multiplicityUnnamed 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 graphCharacterization of oriented graphs of rank 2On 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 graphOn the relationship between the skew-rank of an oriented graph and the rank of its underlying graphBounds for the skew Laplacian (skew adjacency) spectral radius of a digraphNullity of a graph in terms of path cover numberBounds on the nullity, the H-rank and the Hermitian energy of a mixed 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 verticesOn the balanced domination of graphsSkew-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: Relation between the skew-rank of an oriented graph and the rank of its underlying graph