Hermitian adjacency matrix of the second kind for mixed graphs

DOI10.1016/J.DISC.2022.112798zbMATH Open1484.05133arXiv2102.03760OpenAlexW3129106274MaRDI QIDQ2113348FDOQ2113348

Authors: Shuchao Li, Yuantian Yu 

Publication date: 14 March 2022

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

Abstract: This contribution gives an extensive study on spectra of mixed graphs via its Hermitian adjacency matrix of the second kind { ($N$-matrix for short)} introduced by Mohar cite{0001}. This matrix is indexed by the vertices of the mixed graph, and the entry corresponding to an arc from $u$ to $v$ is equal to the sixth root of unity $$ (and its symmetric entry is $$); the entry corresponding to an undirected edge is equal to 1, and 0 otherwise. The main results of this paper include the following: {equivalent} conditions for a mixed graph that shares the same spectrum of its $N$-matrix with its underlying graph are given. A sharp upper bound on the spectral radius is established and the corresponding extremal mixed graphs are identified. Operations which are called two-way and three-way switchings are discussed--they give rise to some cospectral mixed graphs. We extract all the mixed graphs whose rank of its $N$-matrix is $2$ (resp. 3). Furthermore, we show that {if $M_G$ is a connected mixed graph with rank $2,$ then $M_G$ is switching equivalent to each connected mixed graph to which it is cospectral}. However, this does not hold for some connected mixed graphs with rank $3$. We identify all mixed graphs whose eigenvalues of its $N$-matrix lie in the range $(-alpha,,alpha)$ for $alphainleftsqrt2,,sqrt3,,2ight$.

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

Recommendations

• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• On mixed graphs whose Hermitian spectral radii are at most 2
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• Mixed graphs with \(H\)-rank 3

zbMATH Keywords

rankspectral radiusmixed graphcharacteristic polynomialswitching equivalencecospectrality

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• The effect on A_α-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
• HS-integral and Eisenstein integral normal mixed Cayley graphs
• HS-splitting fields of abelian mixed Cayley graphs
• Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs
• Characterizing signed mixed graphs with small eigenvalues
• On the spectrum of complex unit gain graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)
• Splitting fields of some matrices of normal (mixed) Cayley graphs
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• Title not available (Why is that?)
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113348)