On mixed graphs whose Hermitian spectral radii are at most 2
From MaRDI portal
Publication:2227996
Abstract: A mixed graph is a graph with undirected and directed edges. Guo and Mohar in 2017 determined all mixed graphs whose Hermitian spectral radii are less than . In this paper, we give a sufficient condition which can make Hermitian spectral radius of a connected mixed graph strictly decreasing when an edge or a vertex is deleted, and characterize all mixed graphs with Hermitian spectral radii at most and with no cycle of length in their underlying graphs.
Recommendations
- Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
- Mixed paths and cycles determined by their spectrum
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
- Hermitian adjacency matrix of the second kind for mixed graphs
Cites work
- 3-regular mixed graphs with optimum Hermitian energy
- Cyclotomic matrices over the Eisenstein and Gaussian integers
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- Interlacing families and the Hermitian spectral norm of digraphs
- Mixed graphs with \(H\)-rank 3
- On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
- On oriented graphs whose skew spectral radii do not exceed 2
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Some inequalities on the skew-spectral radii of oriented graphs
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- The spectral distribution of random mixed graphs
Cited in
(20)- On the largest eigenvalue of a mixed graph with partial orientation
- Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
- Maximal digraphs whose Hermitian spectral radius is at most 2
- Hermitian adjacency matrix of the second kind for mixed graphs
- Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
- Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra
- On graphs whose orientations are determined by their Hermitian spectra
- Generalized spectral characterization of mixed graphs
- Mixed paths and cycles determined by their spectrum
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- The spectra of random mixed graphs
- scientific article; zbMATH DE number 4112622 (Why is no real title available?)
- Spectra of line graphs of semiregular mixed graphs
- Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
- Quantum state transfer on integral oriented circulant graphs
- Incidence matrices and line graphs of mixed graphs
- Characterizing signed mixed graphs with small eigenvalues
- The index weighted Hermitian adjacency matrices for mixed graphs
- The Hoffman program for mixed graphs
- On spectra of Hermitian Randić matrix of second kind
This page was built for publication: On mixed graphs whose Hermitian spectral radii are at most 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227996)