On the relation between theH-rank of a mixed graph and the matching number of its underlying graph

DOI10.1080/03081087.2017.1374327zbMath1392.05071OpenAlexW2754251484MaRDI QIDQ4580054

Chen Chen, Jing Huang, Shuchao Li

Publication date: 13 August 2018

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

Full work available at URL: https://doi.org/10.1080/03081087.2017.1374327

zbMATH Keywords

mixed graph\(H\)-ranklower-optimalupper-optimal

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (29)

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 ⋮ Bounds for the rank of a complex unit gain graph in terms of the independence number ⋮ On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph ⋮ On the characterization of digraphs with given rank ⋮ Relations between the inertia indices of a mixed graph and those of its underlying graph ⋮ The rank of a complex unit gain graph in terms of the matching number ⋮ The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs ⋮ Bounds for the matching number and cyclomatic number of a signed graph in terms of rank ⋮ Inertia indices of a complex unit gain graph in terms of matching number ⋮ Proof of a conjecture on the nullity of a graph ⋮ Relation between the trace norm of an oriented graph and its rank ⋮ Incidence matrices and line graphs of mixed graphs ⋮ On the inertia index of a mixed graph in terms of the matching number ⋮ On graphs whose orientations are determined by their Hermitian spectra ⋮ An improved lower bound for the nullity of a graph in terms of matching number ⋮ On mixed graphs whose Hermitian spectral radii are at most 2 ⋮ Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph ⋮ No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\) ⋮ 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 negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum ⋮ 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 ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• Some inequalities on the skew-spectral radii of oriented graphs
• Skew spectra of oriented bipartite graphs
• 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
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Skew spectra of oriented graphs
• 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
• Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube
• The skew-rank of oriented graphs
• More on the minimum skew-rank of graphs
• 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: On the relation between theH-rank of a mixed graph and the matching number of its underlying graph