𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adjacency matrices and chemical transformation graphs

✍ Scribed by L. A. Gribov; V. A. Dementiev; I. V. Mikhailov

Publisher
SP MAIK Nauka/Interperiodica
Year
2008
Tongue
English
Weight
91 KB
Volume
49
Category
Article
ISSN
0022-4766

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with nilpotent adjacency matrices
Graphs with nilpotent adjacency matrices
✍ Martin W. Liebeck πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 149 KB

## Abstract Given any integer __t__ β‰₯ 2 and any prime number __p__, a graph Ξ“~__p,t__~ is constructed whose adjacency matrix is nilpotent of index __t__ over Z~__p__'~ the field of __p__ elements.

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