TOPICS
Search

Hajós Graph


The name Hajós graph is used for two different graphs.

HajosGraph

In one usage (Berge 1989, p. 6; Brandstädt et al. 1999), it denotes the Sierpiński gasket graph S_2, illustrated above. Berge (1989, p. 6) describes this graph as "a triangle inscribed in a hexagon." This graph has six vertices and nine edges. It is the complete-core 3-sun graph, constructed from a triangle graph by adding one new vertex for each edge, joining it to that edge's endpoints and retaining all three original edges.

MoserSpindle

In another usage (Bondy and Murty 2008, p. 358), the name denotes the Moser spindle, illustrated above. Bondy and Murty (2008) do not explain the origin of this name or cite a source for this naming usage. This is a unit-distance graph with seven vertices, eleven edges and chromatic number 4. The two meanings therefore denote distinct graphs, not different embeddings of the same graph.


See also

Moser Spindle, Sierpiński Gasket Graph, Sun Graph

Explore with Wolfram|Alpha

References

Berge, C. "Minimax Relations for the Partial q-Colorings of a Graph." Disc. Math. 74, 3-14, 1989. https://doi.org/10.1016/0012-365X(89)90193-3.Bondy, J. A. and Murty, U. S. R. Graph Theory. Berlin, Germany: Springer-Verlag, p. 358, 2008.Brandstädt, A.; Le, V. B.; and Spinrad, J. P. Graph Classes: A Survey. Philadelphia, PA: SIAM, 1999.House of Graphs. Hajós Graphs. Triangular grid Tr2 and Moser Spindle.

Referenced on Wolfram|Alpha

Hajós Graph

Cite this as:

Weisstein, Eric W. "Hajós Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/HajosGraph.html

Subject classifications