✦ LIBER ✦

Matrices eigenvalues, and directed graphs

✍ Scribed by Brualdi, Richard A.

Book ID: 120217619
Publisher: Taylor and Francis Group
Year: 1982
Tongue: English
Weight: 1024 KB
Volume: 11
Category: Article
ISSN: 0308-1087
DOI: 10.1080/03081088208817439

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eigenvalues of matrices with tree graphs

✍ Clark Jeffries; P. van den Driessche 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 827 KB

Eigenvalues of oriented-graph matrices

✍ Jiong-Sheng Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 495 KB

Realization of Matrices and Directed Gra

Realization of Matrices and Directed Graphs

✍ Rajeev Motwani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 182 KB

We consider the problem of constructing a matrix with prescribed row and Ä 4 column sums, subject to the condition that the off-diagonal entries are in 0, 1 and the diagonal entries are nonnegative integers. The pair of row and column sum vectors is called realizable if such a matrix exists. This is

On graphs whose Laplacian matrices have

On graphs whose Laplacian matrices have distinct integer eigenvalues

✍ Shaun M. Fallat; Stephen J. Kirkland; Jason J. Molitierno; M. Neumann 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

## Abstract In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integer eigenvalues. We define the set __S~i,n~__ to be the set of all integers from 0 to __n__, excluding __i__. If there exists a graph whose Laplacian matrix has this set as its eigenvalues

Low eigenvalues of Laplacian matrices of

Low eigenvalues of Laplacian matrices of large random graphs

✍ Jiang, Tiefeng 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 256 KB

Switching classes of directed graphs and

Switching classes of directed graphs and H-equivalent matrices

✍ Ying Cheng 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 781 KB

In this paper, we define and study the switching classes of directed graphs. The definition is a generalization of both Van Lint and Seidel's switching classes of graphs and Cameron's switching classes of tournaments. We actually do it in a general way so that Wells" signed switching classes of grap