On the largest eigenvalue of a mixed graph with partial orientation

DOI10.1016/j.laa.2021.06.003zbMath1468.05173arXiv2003.08782OpenAlexW3010661968MaRDI QIDQ2041770

Bo-Jun Yuan, Yi Wang, Yi-Zheng Fan

Publication date: 23 July 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

largest eigenvaluematching polynomialmixed graphHermitian adjacency matrixpartial orientationinterlacing family

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Cites Work

• Unnamed Item
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• On the zeros of convex combinations of polynomials
• The roots of the independence polynomial of a clawfree graph
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Obreschkoff's theorem revisited: What convex sets are contained in the set of hyperbolic polynomials?
• Interlacing families and the Hermitian spectral norm of digraphs
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Large regular bipartite graphs with median eigenvalue 1
• Theory of monomer-dimer systems
• Quasi-Random Oriented Graphs
• Quasi-random tournaments

This page was built for publication: On the largest eigenvalue of a mixed graph with partial orientation