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

From MaRDI portal
Publication:725520

DOI10.1016/j.laa.2018.04.032zbMath1392.05077OpenAlexW2803910663MaRDI QIDQ725520

Wenjun Luo, Shuchao Li, Jing Huang

Publication date: 1 August 2018

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

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



Related Items

Relation between the inertia indices of a complex unit gain graph and those of its underlying graph, An upper bound of the nullity of a graph in terms of order and maximum degree, On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph, Complex unit gain graphs of rank 2, On the characterization of digraphs with given rank, Relations between the inertia indices of a mixed graph and those of its underlying graph, Proof of a conjecture on the nullity of a graph, Smith normal form and the generalized spectral characterization of oriented graphs, Relation between the trace norm of an oriented graph and its rank, On the difference between the skew-rank of an oriented graph and the rank of its underlying graph, An improved lower bound for the nullity of a graph in terms of matching number, 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, Characterization of oriented graphs of rank 2, On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs, Some mixed graphs with \(H\)-rank 4, 6 or 8, Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph, Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph, 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, The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices


Uses Software


Cites Work