𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unboundedness of Adjacency Matrices of Locally Finite Graphs

✍ Scribed by Sylvain Golénia

Publisher
Springer
Year
2010
Tongue
English
Weight
187 KB
Volume
93
Category
Article
ISSN
0377-9017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Decomposing Ends of Locally Finite Graph
Decomposing Ends of Locally Finite Graphs
✍ Heinz Adolf Jung; Peter Niemeyer 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 905 KB

An important invariant of translations of infinite locally finite graphs is that of a direction as introduced by HALIN. This invariant gives not much information if the translation is not a proper one. A new refined concept of directions is investigated. A double ray D of a graph X is said to be me