Pappus-Desargues digraph confrontation

preprint2012arXivOpen access

Abstract

Like the Coxeter graph became reattached into the Klein graph in [2], the Levi graphs of the 939_3 and 10310_3 self-dual configurations, known as the Pappus and Desargues (kk-transitive) graphs P\mathcal P and D\mathcal D (where k=3k=3), also admit reattachments of the distance-(k−1)(k-1) graphs of half of their oriented shortest cycles via orientation assignments on their common (k−1)(k-1)-arcs, concurrent for P{\mathcal P} and opposite for D\mathcal D, now into 2 disjoint copies of their corresponding Menger graphs. Here, P\mathcal P is the unique cubic distance-transitive (or CDT) graph with the concurrent-reattachment behavior while D\mathcal D is one of 7 CDT graphs with the opposite-reattachment behavior, that include the Coxeter graph. Thus, P\mathcal P and D\mathcal D confront each other in these respects, obtained via C\mathcal C-ultrahomogeneous graph techniques [3,4] that allow to characterize the obtained reattachment Menger graphs in the same terms.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.