Pappus-Desargues digraph confrontation

From MaRDI portal




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











This page was built for publication: Pappus-Desargues digraph confrontation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875895)