✦ LIBER ✦

Self-Avoiding Paths and the Adjacency Matrix of a Graph

✍ Scribed by Ponstein, J.

Book ID: 118193101
Publisher: Society for Industrial and Applied Mathematics
Year: 1966
Tongue: English
Weight: 1003 KB
Volume: 14
Category: Article
ISSN: 0036-1399
DOI: 10.1137/0114051

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Self-Avoiding Paths and the Adjacency Ma

Self-Avoiding Paths and the Adjacency Matrix of a Graph

✍ J. Ponstein 📂 Article 📅 1966 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 768 KB

On the adjacency matrix of a threshold g

On the adjacency matrix of a threshold graph

✍ Bapat, R.B. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 192 KB

The Determinant of the Adjacency Matrix

The Determinant of the Adjacency Matrix of a Graph

✍ Harary, Frank 📂 Article 📅 1962 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 873 KB

The Determinant of the Adjacency Matrix

The Determinant of the Adjacency Matrix of a Graph

✍ Frank Harary 📂 Article 📅 1962 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 823 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

T-Increasing Paths on the Bruhat Graph o

T-Increasing Paths on the Bruhat Graph of Affine Weyl Groups are Self-Avoiding

✍ Paola Cellini 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Let W, S be a Coxeter system, T s wsw ¬ s g S, w g W its set of reflections, $ any total reflection order, and ⌫ the undirected Bruhat graph. We Ä 4 consider the natural labeling of the edges of ⌫ which assigns to the edge ¨, w the reflection ¨wy1 . A path on ⌫, i.e., a sequence ¨, . . . , ¨such tha