𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The incidence matrix and labelings of a graph

✍ Scribed by R.H Jeurissen

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
598 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The gap of the graph of a matrix
The gap of the graph of a matrix
✍ Javad Faghih-Habibi πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 116 KB
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 _

Harmonious labelings of windmill graphs
Harmonious labelings of windmill graphs and related graphs
✍ D. Frank Hsu πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 115 KB

## Abstract A strongly harmonious labeling is the nonmodular version of a harmonious labeling. The windmill graph __K__^(__t__^)~__n__~ is the graph consisting of __t__ copies of the complete graph __K~n~__ with a vertex in common. It is shown that, for __t__ β‰₯ 1, __K__^(__t__^)~__n__~ is strongly