Pentatope Graph

Author

Eric W. Weisstein
November 27, 2023

This notebook downloaded from http://mathworld.wolfram.com/notebooks/GraphTheory/PentatopeGraph.nb.

For more information, see Eric's MathWorld entry http://mathworld.wolfram.com/PentatopeGraph.html.

©2023 Wolfram Research, Inc. except for portions noted otherwise

Embeddings

Names

GraphData["PentatopeGraph","StandardName"]

GraphData["PentatopeGraph","StandardNames"]

Primary

GraphData["PentatopeGraph"]//StyleGraphs[#,ImageSize->Small]&

Read and Wilson construction

All

GraphData["PentatopeGraph","Graph","All"]//StyleGraphs

Inexact

Select[GraphData["PentatopeGraph","Graph","All"],(!FreeQ[GraphEmbedding[#],_?InexactNumberQ]&)]//StyleGraphs

Embedding types

GraphDataEmbeddings[GraphData["PentatopeGraph","EdgeList"]]

Default embedding

GraphPlot@GraphData["PentatopeGraph","Edges"]

v={};
g=Graph[Range[Length[v]],UndirectedEdge@@@{},VertexCoordinates->v,VertexLabels->Automatic]

RecognizeGraph[g]

Degenerate

GraphData["PentatopeGraph","Graph","Degenerate"]//StyleGraphs

DegenerateGraphEmbeddingTypes/@GraphData["PentatopeGraph","Graph","Degenerate"]

Bilateral

GraphData["PentatopeGraph","Graph","Bilateral"]//StyleGraphs

Circular

GraphData["PentatopeGraph","Graph","Circular"]//StyleGraphs

Planar

GraphData["PentatopeGraph","Planar"]

GraphData["PentatopeGraph","Graph","Planar"]//StyleGraphs

MinimalCrossing

GraphData["PentatopeGraph",{"RCN","CN"}]

GraphData["PentatopeGraph","Graph","MinimalCrossing"]//StyleGraphs

MinimalCrossing construction

(cn=CrossingNumber[GraphData["PentatopeGraph"],TimeConstraint->1])//AbsoluteTiming

(g=MinimalCrossingGraph[GraphData["PentatopeGraph"],"CrossingNumber"->cn])//PolyhedralGraphQ

faces=ReverseSort@SymmetricallyDistinctFaces[g]

Tally[ReverseSort[Length/@faces]]

IGLayoutTutte[g,"OuterFace"->#]&/@faces

Union[Select[Table[RotateGraph[MinimalCrossingGraph[GraphData["PentatopeGraph"],"CrossingNumber"->cn,RandomSeed->n]],{n,50}],Max[OuterFace[#]]<=GraphData["PentatopeGraph","V"]&]]//Timing

Table[MinimalCrossingGraph[GraphData["PentatopeGraph"],"CrossingNumber"->cn,RandomSeed->i],{i,50}]//Union

v={};
g=Graph[Range[Length[v]],UndirectedEdge@@@{},VertexCoordinates->v,VertexLabels->Automatic]

RecognizeGraph[g]

RectilinearCrossingCount[g]

Circulant

GraphData["PentatopeGraph","Circulant"]

GraphData["PentatopeGraph","Graph","Circulant"]//StyleGraphs

Line graph

GraphData["PentatopeGraph","Line"]

LineGraphQ[GraphData["PentatopeGraph"]]//Timing

RootGraph

Select[GraphData[All],GraphData[#,"LineGraph","Name"]=== "PentatopeGraph"&]

RootGraph[GraphData["PentatopeGraph"]]

Halin

GraphData["PentatopeGraph","Halin"]

GraphData["PentatopeGraph","Graph","Halin"]//StyleGraphs

Rigid

GraphData["PentatopeGraph","Rigid"]

GraphData["PentatopeGraph","Graph","Rigid"]//StyleGraphs

Flexible

GraphData["PentatopeGraph","Flexible"]

GraphData["PentatopeGraph","Graph","Flexible"]//StyleGraphs

LCF

GraphData["PentatopeGraph","LCF"]

GraphData["PentatopeGraph","HamiltonianCycleCount"]

GraphData["PentatopeGraph","LCFSignature"]

GraphData["PentatopeGraph","LCFNotations"]

GraphData["PentatopeGraph","Graph","LCF"]//StyleGraphs

Tally[LCFNotation[#][[2]]&/@%]

LCF compute all

Length[FindHamiltonianCycle[GraphData["PentatopeGraph"],All][[All,All,1]]]//Timing

Tally[(lcf=LCF[GraphData["PentatopeGraph"],All])[[All,2]]]//Timing

lcf

LCFGraph@@@lcf//StyleGraphs

(gs=Flatten[{
(* all LCF's with order >1, sorted by order and with bilateral graphs first *)
Join[DeleteCases[#,{_Missing,_}][[All,1]],Cases[#,{_Missing,_}][[All,2]]]&/@Map[{BilateralLCFGraph@#,#}&,Map[LCFGraph@@#&,SplitBy[DeleteCases[lcf,{_,1}],Last],{2}],{2}],
(* order-1 bilateral only *)
DeleteMissing[BilateralLCFGraph@@@Cases[lcf,{_,1}]]}])//Timing

Length[gs]

UnitDistance

GraphData["PentatopeGraph","UnitDistance"]

UnitDistanceGraphQ[GraphData["PentatopeGraph"],Debug->True]//Timing

GraphData["PentatopeGraph","Graph","UnitDistance"]//StyleGraphs

Select[%,!FreeQ[GraphEmbedding[#],_?InexactNumberQ]&]

UnitDistance by refinement

UnitDistanceEmbeddingRefine[Graph[GraphData["PentatopeGraph","VertexList"],GraphData["PentatopeGraph","EdgeList"]],MaxIterations->500]

UnitDistanceEmbeddingRefine[Annotate[#,VertexCoordinates->N[GraphEmbedding[#]]],MaxIterations->500]&/@Complement@@(GraphData["PentatopeGraph","Graph",#]&/@{"All","UnitDistance"})

UnitDistance by FindUnitDistanceEmbedding

FindUnitDistanceEmbedding[GraphData["PentatopeGraph"],MaxIterations->5000,"ReturnWithMessage"->True]//Timing

Matchstick

GraphData["PentatopeGraph","Matchstick"]

GraphData["PentatopeGraph","Graph","Matchstick"]//StyleGraphs

3D default

Graph3D[GraphData["PentatopeGraph","Edges"]]

3D All

GraphData["PentatopeGraph","Graph",{"3D","All"}]

3D UnitDistance

GraphData["PentatopeGraph","Graph",{"3D","UnitDistance"}]

3D Polyhedron

GraphData["PentatopeGraph","Polyhedral"]

GraphData

GraphDataClassString

GraphDataClassString["PentatopeGraph"]