✦ LIBER ✦

A New Adjacency Matrix for Finite Graphs

✍ Scribed by George Stacey Staples

Book ID: 105751405
Publisher: Springer
Year: 2008
Tongue: English
Weight: 206 KB
Volume: 18
Category: Article
ISSN: 0188-7009
DOI: 10.1007/s00006-008-0116-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universal circuit matrix for adjacency g

Universal circuit matrix for adjacency graphs of feedback functions

✍ Jerzy Żurawiecki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 267 KB

We define the class of undirected graphs associated with the feedback functions. Next, we construct a mapping which transforms a given feedback function into the circuit matrix of the corresponding graph. This mapping establishes some linear dependences between the nonlinear feedback functions, so i

Transforming an adjacency matrix into a

Transforming an adjacency matrix into a planar graph

✍ R. Hashimshony; E. Shaviv; A. Wachman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 956 KB

Adjacency matrix generation from the ima

Adjacency matrix generation from the image of graphs: a morphological approach

✍ Amit K. Das; Bhabatosh Chanda 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 292 KB

An Adjacency Criterion for the Prime Gra

An Adjacency Criterion for the Prime Graph of a Finite Simple Group

✍ A. V. Vasiliev; E. P. Vdovin 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 348 KB

An edge-oriented adjacency list for undi

An edge-oriented adjacency list for undirected graphs

✍ L. K. Chen; B. S. Ting; A. Sangiovanni-Vincentelli 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

On the characteristic polynomial of the

On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph

✍ Shoji Shinoda 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 295 KB