✦ LIBER ✦

Eigenvalues of oriented-graph matrices

✍ Scribed by Jiong-Sheng Li

Book ID: 107826556
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 495 KB
Volume: 221
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)00233-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matrices eigenvalues, and directed graph

Matrices eigenvalues, and directed graphs

✍ Brualdi, Richard A. 📂 Article 📅 1982 🏛 Taylor and Francis Group 🌐 English ⚖ 1024 KB

Eigenvalues of matrices with tree graphs

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

Low eigenvalues of Laplacian matrices of

Low eigenvalues of Laplacian matrices of large random graphs

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

Bipartite graphs obtained from adjacency

Bipartite graphs obtained from adjacency matrices of orientations of graphs

✍ K.B. Reid 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 630 KB

If G denotes a graph of order n, then the adjacency matf;ix of an orientation G of G can be thought of as the adjacency matrix of a bipartite graph B(G) of order 2n, where the rows and columns correspond to the bipartition of B(G). For agraph H, let k(H) denote the number of connected components of

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

Eigenvalues of centrosymmetric matrices

✍ N. Muthiyalu; S. Usha 📂 Article 📅 1992 🏛 Springer Vienna 🌐 English ⚖ 208 KB