✦ LIBER ✦

Locally petersen graphs

✍ Scribed by J. I. Hall

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 684 KB
Volume: 4
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190040206

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A graph Γ is locally Petersen if, for each point t of Γ, the graph induced by Γ on all points adjacent to t is isomorphic to the Petersen graph. We prove that there are exactly three isomorphism classes of connected, locally Petersen graphs and further characterize these graphs by certain of their parameters.

📜 SIMILAR VOLUMES

Locally K3,3 or Petersen graphs

✍ A. Blokhuis; A.E. Brouwer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 617 KB

## Blokhuis, A. and A.E. Brouwer, Locally K,,, or Petersen graphs, Discrete Mathematics 106/107 (1992) 53-60. We determine all graphs with the property that each of its local graphs (point neighbourhoods) is isomorphic to either the Petersen graph or the complete bipartite graph K,,,. This answer

Supereulerian Graphs and the Petersen Gr

Supereulerian Graphs and the Petersen Graph

✍ Paul A. Catlin; Hong-Jian Lai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 619 KB

Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph.

The ubiquitous Petersen graph

✍ Gary Chartrand; Héctor Hevia; Robin J. Wilson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Which generalized petersen graphs are ca

Which generalized petersen graphs are cayley graphs?

✍ Roman Nedela; Martin Škoviera 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 572 KB

## Abstract The generalized Petersen graph __GP__ (__n, k__), __n__ ≤ 3, 1 ≥ __k__ < __n__/2 is a cubic graph with vertex‐set {u~j~; i ϵ Z~n~} ∪ {v~j~; i ϵ Z~n~}, and edge‐set {u~i~u~i~, u~i~v~i~, v~i~v~i+k, iϵ~Z~n~}. In the paper we prove that (i) __GP__(__n, k__) is a Cayley graph if and only if

Locally Pancyclic Graphs

✍ Ladislav Stacho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 215 KB

We prove the following theorem. Let G be a graph of order n and let W V(G). If |W | 3 and d G (x)+d G ( y) n for every pair of non-adjacent vertices x, y # W, then either G contains cycles C 3 ,

On Petersen's graph theorem

✍ Nathan Linial 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 399 KB

In thiq paper we prove the following: let G be a graph with k edges, wihich js (k -l)-edgeconnectd, and with all valences 3k k. Let 1 c r~ k be an integer, then (3 -tins a spanning subgraph H, so that all valences in H are ar, with no more than r~/r:] edges. The proof is based on a useful extension