On digraphs with polygonal restricted numerical range

DOI10.1016/j.laa.2022.02.034zbMath1487.05104arXiv2106.00701OpenAlexW4214677579MaRDI QIDQ2133686

Alexander Wiedemann, Thomas R. Cameron, Ben Small, H. Tracy Hall

Publication date: 5 May 2022

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

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

zbMATH Keywords

numerical rangedirected graphLaplacianalgebraic connectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Computational methods for problems pertaining to geometry (51-08)

Related Items (1)

On the Laplacian spread of digraphs

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normal matrices
• Normality and the numerical range
• Practical graph isomorphism. II.
• Laplacian dynamics on general graphs
• On a matrix inequality and its application to the synchronization in coupled chaotic systems
• Numerical Determination of the Field of Values of a General Complex Matrix
• On the numerical range of a matrix
• Algebraic connectivity of directed graphs
• Über den Wertevorrat einer Matrix
• On the restricted numerical range of the Laplacian matrix for digraphs

This page was built for publication: On digraphs with polygonal restricted numerical range