Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
DOI10.1016/j.disc.2023.113612zbMath1530.05120OpenAlexW4385369825MaRDI QIDQ6080566
Shuchao Li, Zihan Zhou, Yuantian Yu
Publication date: 4 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113612
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral properties of complex unit gain graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Oriented gain graphs, line graphs and eigenvalues
- Quantum invariants at the sixth root of unity
- On maximum-sized near-regular and \(\root 6\of{1}\)-matroids
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- On the spectrum of an equitable quotient matrix and its application
- Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
- Spectral fundamentals and characterizations of signed directed graphs
- Hermitian adjacency matrix of the second kind for mixed graphs
- Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
- Spectral properties of the eccentricity matrix of graphs
- 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
- On mixed graphs whose Hermitian spectral radii are at most 2
- 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
- Distance-regular Cayley graphs with least eigenvalue \(-2\)
- 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
- On a property of the class of n-colorable graphs
- On Matroids Representable over 𝐺𝐹(3) and Other Fields
This page was built for publication: Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
