𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The center of an infinite graph

✍ Scribed by L. Boza; A. Diánez; A. Márquez

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
344 KB
Volume
161
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give different characterizations of when a vertex is in the center of an infinite graph and we prove that any infinite graph with at least two ends has a center. This work is a part of the Ph.D. thesis 'El centro de una familia creciente de grafos finitos ' [3] presented in the University of Seville in December 1994.

📜 SIMILAR VOLUMES

An infinite family of integral graphs
An infinite family of integral graphs
✍ Moshe Roitman 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 272 KB

We obtain here an infinite family of integral complete tripartite grapbs. The 'purpose-of this note is to obtain an infinite family of integral mmpjete tripartite graphs. For background see [l]. We recall first some detitions and facts. A complete n-pu\*te gnzph K(p\*, l . l 5 p,,) is a graph with a

The bond and cycle spaces of an infinite
The bond and cycle spaces of an infinite graph
✍ Karel Casteels; R. Bruce Richter 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

## Abstract Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and Kühn introduced a different cycle space of infinite graphs based on allowing infinite circuits. A more general point of view w

An infinite family of biprimitive semisy
An infinite family of biprimitive semisymmetric graphs
✍ Du, Shao-Fei; Maru??i??, Dragan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 1 views

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimiti

An infinite class of reach-preservable g
An infinite class of reach-preservable graphs
✍ Gagliardi, Daniel; Lewinter, Marty 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 42 KB 👁 1 views

for all w in G. G is called reach-preservable if each of its spanning trees contains at least one reachpreserving vertex. We show that K 2,n is reach-preservable. We show that a graph is bipartite if and only if given any pair of vertices, there exists a spanning tree in which both vertices a reach-