On the characteristic polynomials and H-ranks of the weighted mixed graphs
From MaRDI portal
Publication:2273886
Recommendations
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.
- Mixed graphs with \(H\)-rank 3
Cites work
- 3-regular mixed graphs with optimum Hermitian energy
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- First eigenvalue of nonsingular mixed unicyclic graphs with fixed number of branch vertices
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian Laplacian matrix and positive of mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Minimum rank of skew-symmetric matrices described by a graph
- Mixed graphs with \(H\)-rank 3
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On the Laplacian characteristic polynomials of mixed graphs
- On the mixed adjacency matrix of a mixed graph
- On the rank of a real skew symmetric matrix described by an oriented graph
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Relationship between the rank and the matching number of a graph
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Skew spectra of oriented graphs
- Skew-rank of an oriented graph in terms of matching number
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- The Factorization of Linear Graphs
- The rank of a signed graph in terms of the rank of its underlying graph
- The skew energy of a digraph
- The spectral distribution of random mixed graphs
Cited in
(7)- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- A characteristic polynomial for rooted mixed graphs
- On the Laplacian characteristic polynomials of mixed graphs
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
This page was built for publication: On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2273886)
