Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph

DOI10.1016/j.disc.2019.01.009zbMath1407.05144arXiv1812.05309OpenAlexW2964307687MaRDI QIDQ1732760

Minjie Zhang, Chen Chen, Shuchao Li

Publication date: 25 March 2019

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

Full work available at URL: https://arxiv.org/abs/1812.05309

zbMATH Keywords

mixed graph\(H\)-rank\(\delta\)-transformationlower-optimalupper-optimal

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Relation between the inertia indices of a complex unit gain graph and those of its underlying graph ⋮ On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph ⋮ Relations between the inertia indices of a mixed graph and those of its underlying graph ⋮ Some families of integral mixed graphs ⋮ The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs ⋮ Incidence matrices and line graphs of mixed graphs ⋮ On graphs whose orientations are determined by their Hermitian spectra ⋮ Unnamed Item ⋮ On mixed graphs whose Hermitian spectral radii are at most 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 ⋮ The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs

Cites Work

• Unnamed Item
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• The spectral distribution of random mixed graphs
• First eigenvalue of nonsingular mixed unicyclic graphs with fixed number of branch vertices
• Mixed graphs with \(H\)-rank 3
• Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
• On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• The rank of a graph after vertex addition
• An upper bound of the nullity of a graph in terms of order and maximum degree
• A characterization of long graphs of arbitrary rank
• Large regular bipartite graphs with median eigenvalue 1
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• A characterization of signed planar graphs with rank at most 4
• The nullity ofk-cyclic graphs of ∞-type
• On the nullity of graphs
• On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
• The skew-rank of oriented graphs
• Graphs and matrices
• On the mixed adjacency matrix of a mixed graph
• Skew-rank of an oriented graph in terms of matching number
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• The extremal graphs with respect to their nullity

This page was built for publication: Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph