The k-generalized Hermitian adjacency matrices for mixed graphs
From MaRDI portal
Publication:2099490
Recommendations
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Hermitian adjacency matrix of the second kind for mixed graphs
- Nullity of Hermitian-adjacency matrices of mixed graphs
- Hermitian Laplacian matrix and positive of mixed graphs
- Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- The Hermitian Kirchhoff index and robustness of mixed graph
- scientific article; zbMATH DE number 7666851
- On the mixed adjacency matrix of a mixed graph
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A characterization of signed planar graphs with rank at most 4
- A new kind of Hermitian matrices for digraphs
- Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- Bounds on the nullity, the \(H\)-rank and the Hermitian energy of a mixed graph
- Complex unit gain bicyclic graphs with rank 2, 3 or 4
- Complex unit gain graphs of rank 2
- Complex unit gain graphs with exactly one positive eigenvalue
- Gain distance matrices for complex unit gain graphs
- Hermitian adjacency matrix of the second kind for mixed graphs
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Mixed graphs with \(H\)-rank 3
- On a conjecture concerning spanning tree invariants and loop systems
- On graphs whose orientations are determined by their Hermitian spectra
- On the nullity of graphs
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the spectrum of 3-coloured digraphs
- On weighted directed graphs
- Oriented gain graphs, line graphs and eigenvalues
- 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
- Spectral fundamentals and characterizations of signed directed graphs
- Spectral properties of complex unit gain graphs
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- The rank of a complex unit gain graph in terms of the matching number
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- The relation between the \(H\)-rank of a mixed graph and the independence number of its underlying graph
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
Cited in
(10)- The index weighted Hermitian adjacency matrices for mixed graphs
- Generalized spectral characterization of mixed graphs
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
- scientific article; zbMATH DE number 7666851 (Why is no real title available?)
- The Hermitian Kirchhoff index and robustness of mixed graph
- Hermitian adjacency matrix of the second kind for mixed graphs
- More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs
This page was built for publication: The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099490)
