On the restricted numerical range of the Laplacian matrix for digraphs

被引：2

作者：

Cameron, T. R. ^{[1
]}

Robertson, M. D. ^{[1
]}

Wiedemann, A. ^{[1
]}

机构：

[1] Davidson Coll, Math & Comp Sci Dept, Davidson, NC 28036 USA

来源：

LINEAR & MULTILINEAR ALGEBRA | 2021年 / 69卷 / 05期

关键词：

Numerical range; directed graph; Laplacian; algebraic connectivity; ALGEBRAIC CONNECTIVITY; GRAPHS;

D O I：

10.1080/03081087.2020.1748853

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：840 / 854

页数：15