Hermitian adjacency matrix of the second kind for mixed graphs

DOI10.1016/j.disc.2022.112798zbMath1484.05133arXiv2102.03760OpenAlexW3129106274MaRDI QIDQ2113348

Yuantian Yu, Shuchao Li

Publication date: 14 March 2022

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

Full work available at URL: https://arxiv.org/abs/2102.03760

zbMATH Keywords

spectral radiuscharacteristic polynomialrankcospectralitymixed graphswitching equivalence

Mathematics Subject Classification ID

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

Related Items (9)

Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs ⋮ HS-integral and Eisenstein integral normal mixed Cayley graphs ⋮ Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\) ⋮ HS-splitting fields of abelian mixed Cayley graphs ⋮ More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs ⋮ Characterizing signed mixed graphs with small eigenvalues ⋮ Splitting fields of some matrices of normal (mixed) Cayley graphs ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs ⋮ The effect on A_α-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Switched symplectic graphs and their 2-ranks
• Spectral properties of complex unit gain graphs
• Skew-adjacency matrices of graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Mixed graphs with \(H\)-rank 3
• Graph spectra in computer science
• Spectra of 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
• Spectra of digraphs
• On maximum-sized near-regular and \(\root 6\of{1}\)-matroids
• Spectral fundamentals and characterizations of signed directed graphs
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• On mixed graphs whose Hermitian spectral radii are at most 2
• Bounds for the rank of a complex unit gain graph in terms of its maximum degree
• The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
• A new kind of Hermitian matrices for digraphs
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• Cyclotomic matrices over the Eisenstein and Gaussian integers
• Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
• Large regular bipartite graphs with median eigenvalue 1
• Equiangular lines
• Graph spectral techniques in computer sciences
• Graph Energy
• Inequalities for Graph Eigenvalues
• On Matroids Representable over 𝐺𝐹(3) and Other Fields
• On the mixed adjacency matrix of a mixed graph

This page was built for publication: Hermitian adjacency matrix of the second kind for mixed graphs