✦ LIBER ✦

The gap of the graph of a matrix

✍ Scribed by Javad Faghih-Habibi

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 116 KB
Volume: 186
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)90284-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The gap between the chromatic number of

The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear

✍ A.A. Razborov 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 199 KB

The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear.

On the distance matrix of a directed gra

On the distance matrix of a directed graph

✍ R. L. Graham; A. J. Hoffman; H. Hosoya 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _

The incidence matrix and labelings of a

The incidence matrix and labelings of a graph

✍ R.H Jeurissen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Unimodular congruence of the Laplacian m

Unimodular congruence of the Laplacian matrix of a graph

✍ William Watkins 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 609 KB

The relation between the Jordan structur

The relation between the Jordan structure of a matrix and its graph

✍ Daniel Hershkowitz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 900 KB

On the nonsingular submatrices of the in

On the nonsingular submatrices of the incidence matrix of a graph over the real field

✍ Wai-Kai Chen 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 872 KB

The nonsingular submatrices of maximum order of the complete and the reduced incidence matrices over the real jield of a graph are shown to be in one-to-one correspondence with the odd generalized circuits and the odd generalized k-trees of the graph, respectively. It is also shown that the positiv