Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Möbius–Kantor graph
open-in-new
<p>In the <a href="/facts/Mathematics/pxTouaz4">mathematical</a> field of <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, the Möbius–Kantor graph is a <a href="/facts/Symmetric_graph/vPVWrnjb">symmetric</a> <a href="/facts/Bipartite_graph/xWcXV9MB">bipartite</a> <a href="/facts/Cubic_graph/6M32WUIJ">cubic graph</a> with 16 vertices and 24 edges named after <a href="/facts/August_Ferdinand_M%25C3%25B6bius/8ryQFhWv">August Ferdinand Möbius</a> and <a href="/facts/Seligmann_Kantor/mB5QhuyJ">Seligmann Kantor</a>. It can be defined as the <a href="/facts/Generalized_Petersen_graph/dnmt90Ww">generalized Petersen graph</a> <i>G</i>(8,3): that is, it is formed by the vertices of an <a href="/facts/Octagon/H5PuP3wP">octagon</a>, connected to the vertices of an eight-point star in which each point of the star is connected to the points three steps away from it (an <a href="/facts/Octagram/4mfC9WqR">octagram</a>). </p>