Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
From the Coxeter Graph to the Klein Graph
View through CrossRef
AbstractWe show that the 56‐vertex Klein cubic graph Γ′ can be obtained from the 28‐vertex Coxeter cubic graph Γ by “zipping” adequately the squares of the 24 7‐cycles of Γ endowed with an orientation obtained by considering Γ as a ????‐ultrahomogeneous digraph, where ???? is the collection formed by both the oriented 7‐cycles and the 2‐arcs that tightly fasten those in Γ. In the process, it is seen that Γ′ is a ????′‐ultrahomogeneous (undirected) graph, where ????′ is the collection formed by both the 7‐cycles C7 and the 1‐paths P2 that tightly fasten those C7 in Γ′. This yields an embedding of Γ′ into a 3‐torus T3 which forms the Klein map of Coxeter notation (7, 3)8. The dual graph of Γ′ in T3 is the distance‐regular Klein quartic graph, with corresponding dual map of Coxeter notation (3, 7)8. © 2011 Wiley Periodicals, Inc. J Graph Theory
Title: From the Coxeter Graph to the Klein Graph
Description:
AbstractWe show that the 56‐vertex Klein cubic graph Γ′ can be obtained from the 28‐vertex Coxeter cubic graph Γ by “zipping” adequately the squares of the 24 7‐cycles of Γ endowed with an orientation obtained by considering Γ as a ????‐ultrahomogeneous digraph, where ???? is the collection formed by both the oriented 7‐cycles and the 2‐arcs that tightly fasten those in Γ.
In the process, it is seen that Γ′ is a ????′‐ultrahomogeneous (undirected) graph, where ????′ is the collection formed by both the 7‐cycles C7 and the 1‐paths P2 that tightly fasten those C7 in Γ′.
This yields an embedding of Γ′ into a 3‐torus T3 which forms the Klein map of Coxeter notation (7, 3)8.
The dual graph of Γ′ in T3 is the distance‐regular Klein quartic graph, with corresponding dual map of Coxeter notation (3, 7)8.
© 2011 Wiley Periodicals, Inc.
J Graph Theory.
Related Results
Conjugacy of Coxeter Elements
Conjugacy of Coxeter Elements
For a Coxeter group $(W,S)$, a permutation of the set $S$ is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first l...
On hyperbolic Coxeter n-polytopes with n + 2 facets
On hyperbolic Coxeter n-polytopes with n + 2 facets
Abstract
A convex polytope admits a Coxeter decomposition if it is tiled by finitely many Coxeter polytopes such that any two tiles having a common facet are symmetr...
Combinatorial links between quasisymmetric functions and tableaux for Coxeter groups.
Combinatorial links between quasisymmetric functions and tableaux for Coxeter groups.
Liens combinatoires entre fonctions quasisymétriques et tableaux dans les groupes de Coxeter.
L'algèbre des fonctions symétriques est un outil majeur de la combinat...
Shi arrangements and low elements in Coxeter groups
Shi arrangements and low elements in Coxeter groups
AbstractGiven an arbitrary Coxeter system and a non‐negative integer , the ‐Shi arrangement of is a subarrangement of the Coxeter hyperplane arrangement of . The classical Shi ar...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...
Fully commutative elements and lattice walks
Fully commutative elements and lattice walks
An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. These el...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...