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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.