Fan Graph

A fan graph
is defined as
the graph join
, where
is
the empty graph on nodes and
is the path graph on nodes. The
case
corresponds to the usual
fan graphs, while
corresponds
to the double fan, etc. Precomputed
properties of fan graphs are
implemented
in
theWolfram
Language as GraphData[ "Fan",
m, n ].
The
-fan graph is isomorphic to
the complete tripartite graph
,
and the
-fan graph to
.
The fan graph
is sometimes
known as the gem graph.

"The" H graph is the tree on 6 vertices

illustrated above. It is implemented in
the Wolfram
Language as GraphData["HGraph"].
The term "H-graph" is also used to refer to
a graph expansion with the 6-vertex H
graph as its base (e.g., Horton and Bouwer 1991). There are exactly two graph expansions with H-graph base that
are symmetric (Biggs 1993, p. 147).