The Hoffman program for mixed graphs

1Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider Hoffman's program about the limit points of the spectral radius of the Hermitian adjacency matrix of mixed graphs. In particular, we determine all such limit points. As an intermediate step, we determine all mixed graphs without negative 4-cycle whose spectral radius does not exceed 2+5.

Cite

CITATION STYLE

APA

Yu, Y., & van Dam, E. R. (2025). The Hoffman program for mixed graphs. Linear Algebra and Its Applications, 726, 436–457. https://doi.org/10.1016/j.laa.2025.07.034

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free