The \(k\)-generalized Hermitian adjacency matrices for mixed graphs

DOI10.1016/j.disc.2022.113254zbMath1504.05182OpenAlexW4309339099MaRDI QIDQ2099490

Yuantian Yu, Zihan Zhou, Xianya Geng

Publication date: 23 November 2022

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

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113254

zbMATH Keywords

cospectralitymixed graphspectral determination\(H_k\)-rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (2)

More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs ⋮ On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of graphs with rank 5
• Spectral properties of complex unit gain graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Mixed graphs with \(H\)-rank 3
• A characterization of graphs with rank 4
• On weighted directed graphs
• On a conjecture concerning spanning tree invariants and loop systems
• Oriented gain graphs, line graphs and eigenvalues
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• 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
• Hermitian adjacency matrix of the second kind for mixed graphs
• Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
• Complex unit gain graphs of rank 2
• 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
• On graphs whose orientations are determined by their Hermitian spectra
• Complex unit gain graphs with exactly one positive eigenvalue
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• Gain distance matrices for complex unit gain graphs
• Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
• A new kind of Hermitian matrices for digraphs
• Complex unit gain bicyclic graphs with rank 2, 3 or 4
• The rank of a complex unit gain graph in terms of the rank of its underlying graph
• Large regular bipartite graphs with median eigenvalue 1
• A characterization of signed planar graphs with rank at most 4
• On the spectrum of 3-coloured digraphs
• On the nullity of 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
• The relation between the H-rank of a mixed graph and the independence number of its underlying graph

This page was built for publication: The \(k\)-generalized Hermitian adjacency matrices for mixed graphs