On the restricted numerical range of the Laplacian matrix for digraphs

In this article, we present the restricted numerical for the Laplacian matrix of a directed graph (digraph). We motivate our interest in the restricted numerical range by its close connection to the algebraic connectivity of a digraph. Moreover, we show that the restricted numerical range can be used to characterize digraphs, some of which are not determined by their Laplacian spectrum. Finally, we identify a new class of digraphs that are characterized by having a real restricted numerical range.

Files

Metadata

Work Title On the restricted numerical range of the Laplacian matrix for digraphs
Access
Open Access
Creators
  1. Thomas Cameron
  2. M. D. Robertson
  3. A. Wiedemann
Keyword
  1. algebraic connectivity
  2. directed graph
  3. Laplacian
  4. Numerical range
License All rights reserved
Work Type Article
Publisher
  1. Linear and Multilinear Algebra
Publication Date April 9, 2020
Publisher Identifier (DOI)
  1. https://doi.org/10.1080/03081087.2020.1748853
Deposited October 23, 2020

Versions

Analytics

Collections

This resource is currently not in any collection.

Work History

Version 1
published

  • Created
  • Added Thomas_Cameron__One_the_restricted.pdf
  • Added Creator Thomas Cameron
  • Added Creator M. D. Robertson
  • Added Creator A. Wiedemann
  • Published
  • Updated
  • Updated
  • Updated