From the Coxeter Graph to the Klein Graph

@article{Dejter2012FromTC,
  title={From the Coxeter Graph to the Klein Graph},
  author={I. Dejter},
  journal={J. Graph Theory},
  year={2012},
  volume={70},
  pages={1-9}
}
  • I. Dejter
  • Published 2012
  • Mathematics, Computer Science
  • J. Graph Theory
We 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… Expand
On C-homogeneous graphs and ordered pencils
Let C be a class of graphs. A definition of a C-homogeneous graph G is given that generalizes that of C-ultrahomogeneous graph by considering each induced subgraph of G in C tethered by an arc. Let 2Expand
The Biggs-Smith graph and its distance-3 graph
The distance-3 graph S of the Biggs-Smith graph S is shown to be both a connected edge-disjoint union of 102 tetrahedra, (copies of K4), and a union of 102 cuboctahedra, (copies of L(Q3)), with noExpand
The distance-3 graph of the Biggs-Smith graph
The distance-3 graph S3 of the Biggs-Smith graph S is shown to be: (a) a connected edge-disjoint union of 102 tetrahedra (copies of K4) and as such the K4-ultrahomogeneous Menger graph of a self-dualExpand
On Biggs-Smith graph in CUH-graph context
A method of construction of C-ultrahomogeneous (or C-UH) graphs is applied to the Biggs-Smith graph, which is seen in the process to be a {C9}P4 -UH graph and a { ~ C9} ~ P4 -UH digraph, in order toExpand
On a self-dual $(102_4)$-configuration
A connected edge-disjoint union Y of 102 tetrahedra (copies of K4) is constructed which is Menger graph of a self-dual (1024)-configuration and K4-ultrahomogeneous. As Y is not a line graph, we askExpand
On Pappus , Desargues and other CUH graphs
The notion of a C-ultrahomogeneous (or C-UH) graph, due to D. Isaksen et al., is adapted for digraphs and applied to the cubic distancetransitive graphs, considered as digraphs by replacing each edgeExpand
On a $K_4$-UH self-dual 1-configuration $(102_4)_1$
Self-dual 1-configurations $(n_d)_1$ possess their Menger graph $\mathcal Y$ most $K_4$-separated among connected self-dual configurations $(n_d)$. Such $\mathcal Y$ is most symmetric ifExpand
Proper Jordan schemes exist. First examples, computer search, patterns of reasoning. An essay
A special class of Jordan algebras over a field $F$ of characteristic zero is considered. Such an algebra consists of an $r$-dimensional subspace of the vector space of all square matrices of a fixedExpand

References

SHOWING 1-10 OF 32 REFERENCES
The edge-transitive but not vertex-transitive cubic graph on 112 vertices
A detailed description is given of a recently discovered edge-transitive but not vertex-transitive trivalent graph on 112 vertices, which turns out to be the third smallest example of such aExpand
On a C4-ultrahomogeneous oriented graph
  • I. Dejter
  • Mathematics, Computer Science
  • Discret. Math.
  • 2010
TLDR
A strongly connected C->"4-ultrahomogeneous oriented graph on 168 vertices and 126 pairwise arc-disjoint 4-cycles is presented, with regular indegree and outdegree 3 and no circuits of lengths 2 and 3, by altering a definition of the Coxeter graph. Expand
The Square of a Hamiltonian Cycle
TLDR
This paper proves that, if G is a graph on n vertices with minimum degree $\delta(G)$, then G contains the square of a Hamiltonian cycle. Expand
Highly Symmetric Subgraphs of Hypercubes
Two questions are considered, namely (i) How many colors are needed for a coloring of the n-cube without monochromatic quadrangles or hexagons? We show that four colors suffice and thereby settle aExpand
On K*-Ultrahomogeneous Graphs
TLDR
This work explicitly classify the graphs that are K∗-ultrahomogeneous, where K∷ is the class of complete graphs and tK∗ is theclass of disjoint unions of complete graph. Expand
6-Transitive graphs
  • P. Cameron
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1980
TLDR
It is shown that a 6-transitive graph is complete multipartite, or complete bipartite with a matching deleted, or a cycle, or one of three special graphs on 9, 12 and 20 vertices. Expand
Algebraic Graph Theory
TLDR
The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial. Expand
The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous N-Tournaments
Results and open problems Homogeneous $2$-tournaments Homogeneous $n$-tournaments Homogeneous symmetric graphs Homogeneous directed graphs omitting $I_\infty$ Propositions $16$ to $20$ and MT $2.2$Expand
Why is PSL(2,7)≅ GL(3,2)?
(2009). Why is PSL(2,7)≅ GL(3,2)? The American Mathematical Monthly: Vol. 116, No. 8, pp. 727-732.
...
1
2
3
4
...