On the Laplacian spread of digraphs
Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)
The paper extends the notion of the Laplacian spread to digraphs using the restricted numerical range, where the restricted numerical range is a closed convex set in the complex plane, and the Laplacian spread of a digraph can be viewed geometrically as the length of the real part of its restricted numerical range. The authors then use the digraph characterizations via the restricted numerical range to give the Laplacian spread values for several families of digraphs, resulting in sharp upper bounds on the Laplacian spread for all polygonal digraphs. In addition, it is shown that the Laplacian spread has a sharp bound of \((n-1)\) for all balanced digraphs of order \(n\). Furthermore, it gives an equivalent statement for balanced digraphs with weights in the interval \([0,1]\). It is worth noting that not all digraphs have a Laplacian spread bounded above by their order. Finally, the authors formally state a conjecture regarding the Laplacian spread of digraphs by noting that any bound that is proven for the Laplacian spread of digraphs will hold more generally for weighted digraphs and the concavity of the algebraic connectivity.
- A simple proof of the elliptical range theorem
- Algebraic connectivity of directed graphs
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Integral boundary points of convex polyhedra
- New conjectures on algebraic connectivity and the Laplacian spread of graphs
- Normality and the numerical range
- On digraphs with polygonal restricted numerical range
- On the graph Laplacian and the rankability of data
- On the Laplacian spread of graphs
- On the lower bound of the sum of the algebraic connectivity of a graph and its complement
- On the numerical range of a matrix
- On the restricted numerical range of the Laplacian matrix for digraphs
- Pick's inequality and tournaments
- Practical graph isomorphism. II.
- Some results on the Laplacian spread conjecture
- The algebraic connectivity of a graph and its complement
- The Laplacian spread of a tree
- The Laplacian spread of cactuses
- The Laplacian spread of graphs.
- The Laplacian spread of tricyclic graphs
- The Laplacian spread of unicyclic graphs
- Upper bounds on the Laplacian spread of graphs
- Über den Wertevorrat einer Matrix
- On digraphs with polygonal restricted numerical range
- New conjectures on algebraic connectivity and the Laplacian spread of graphs
- The Laplacian spread of bicyclic graphs
- scientific article; zbMATH DE number 5926156 (Why is no real title available?)
- scientific article; zbMATH DE number 219243 (Why is no real title available?)
- scientific article; zbMATH DE number 6401892 (Why is no real title available?)
- On the restricted numerical range of the Laplacian matrix for digraphs
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
- Upper bounds on the Laplacian spread of graphs
- On the Laplacian spread of digraphs
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 Q2689149)
