Relation between the H-rank of a mixed graph and the girth of its underlying graph
From MaRDI portal
Cites work
- A (terse) introduction to linear algebra
- A note on orientations of mixed graphs
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Generalized matrix tree theorem for mixed graphs
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- Graphs whose minimal rank is two
- Graphs with nullity \(2c(G)+p(G)-1\)
- Hermitian adjacency matrix of digraphs and mixed graphs
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian matrices of roots of unity and their characteristic polynomials
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 1472133 (Why is no real title available?)
- Mixed graphs with \(H\)-rank 3
- On a symmetric representation of Hermitian matrices and its applications to graph theory
- On connected \(\mathbb{T}\)-gain graphs with rank equal to girth
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Rank and null space calculations using matrix decomposition without column interchanges
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- Spektren endlicher Grafen
- The Laplacian eigenvalues of mixed graphs
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
Cited in
(2)
This page was built for publication: Relation between the H-rank of a mixed graph and the girth of its underlying graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965774)
