On the Laplacian spread of digraphs

DOI10.1016/J.LAA.2023.01.016MaRDI QIDQ6403658arXivFDO

Authors Wayne Barrett, Thomas R. Cameron, E. J. Evans, H. Tracy Hall, Mark Kempton

Publication date 30 June 2022

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Structural characterization of families of graphs (05C75) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Abstract: In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper bounds on the Laplacian spread for all polygonal and balanced digraphs. In particular, we show that the validity of the Laplacian spread bound for balanced digraphs is equivalent to the Laplacian spread conjecture for simple undirected graphs, which was conjectured in 2011 and proven in 2021. Moreover, we prove an equivalent statement for weighted balanced digraphs with weights between

0

and

1

. Finally, we state several open conjectures that are motivated by empirical data.

This page was built for publication: On the Laplacian spread of digraphs

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