Pappus-Desargues digraph confrontation

Details Pappus-Desargues digraph confrontation Pappus-Desargues digraph confrontation

2009-04-07

arxiv.org/abs/0904.1096v23

Mathematics

Combinatorics

9 pages, 3 figures, 4 tables

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Pappus-Desargues digraph confrontation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pappus-Desargues digraph confrontation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pappus-Desargues digraph confrontation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313957