Truncated Dodecadodecahedral Graph

Author

Eric W. Weisstein
April 22, 2024

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

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

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

Graphics

GraphicsGrid[Partition[GraphData["TruncatedDodecadodecahedralGraph","Graph","All"]//StyleGraphs,UpTo[6]],ImageSize->700]

Embeddings

<<MathWorld`Graphs`

Names

GraphData["TruncatedDodecadodecahedralGraph","StandardName"]

GraphData["TruncatedDodecadodecahedralGraph","StandardNames"]

Primary

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

All

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

Inexact

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

Embedding types

GraphDataEmbeddings[GraphData["TruncatedDodecadodecahedralGraph","EdgeList"]]

Default embedding

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

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

RecognizeGraph[g]

Degenerate

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

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

Perspective

GraphData["TruncatedDodecadodecahedralGraph","Graph","Perspective"]//StyleGraphs

Perspective construction

GraphData["TruncatedDodecadodecahedralGraph","Graph","3D"]

Manipulate[PolyhedronProjectionGraph[GraphData["TruncatedDodecadodecahedralGraph","Polyhedron"],{x,y,z}],{x,-1,1},{y,-1,1},{z,-1,1}]

PolyhedronProjectionGraph[GraphData["TruncatedDodecadodecahedralGraph","Polyhedron"],{0,.01,.01}]

PolyhedronProjectionGraph[GraphData["TruncatedDodecadodecahedralGraph","Polyhedron"],{0,0,1}]

PolyhedronProjectionGraph[GraphData["TruncatedDodecadodecahedralGraph","Polyhedron"],{0,1,0}]

PolyhedronProjectionGraph[GraphData["TruncatedDodecadodecahedralGraph","Polyhedron"],{1,0.01,0}]

PolyhedronProjectionGraph[GraphData["TruncatedDodecadodecahedralGraph","Polyhedron"],{1,1,0}]

PolyhedronProjectionGraph[GraphData["TruncatedDodecadodecahedralGraph","Polyhedron"],{1,0,1,-Pi/2}]

PolyhedronProjectionGraph[GraphData["TruncatedDodecadodecahedralGraph","Polyhedron"],{1,1,1}]

Bilateral

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

Circular

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

Planar

GraphData["TruncatedDodecadodecahedralGraph","Planar"]

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

MinimalCrossing

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

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

MinimalCrossing construction

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

(cn=CrossingNumber[GraphData["TruncatedDodecadodecahedralGraph"],TimeConstraint->10])//AbsoluteTiming

(cn=CrossingNumber[GraphData["TruncatedDodecadodecahedralGraph"],TimeConstraint->60])//AbsoluteTiming

(cn=CrossingNumber[GraphData["TruncatedDodecadodecahedralGraph"],TimeConstraint->3600])//AbsoluteTiming

(cn=CrossingNumber[GraphData["TruncatedDodecadodecahedralGraph"],TimeConstraint->5 3600])//AbsoluteTiming

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

faces=ReverseSort@SymmetricallyDistinctFaces[g]

Tally[ReverseSort[Length/@faces]]

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

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

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

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

RecognizeGraph[g]

RectilinearCrossingCount[g]

Circulant

GraphData["TruncatedDodecadodecahedralGraph","Circulant"]

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

Line graph

GraphData["TruncatedDodecadodecahedralGraph","Line"]

LineGraphQ[GraphData["TruncatedDodecadodecahedralGraph"]]//Timing

RootGraph

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

RootGraph[GraphData["TruncatedDodecadodecahedralGraph"]]

Halin

GraphData["TruncatedDodecadodecahedralGraph","Halin"]

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

Rigid

GraphData["TruncatedDodecadodecahedralGraph","Rigid"]

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

Flexible

GraphData["TruncatedDodecadodecahedralGraph","Flexible"]

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

LCF

GraphData["TruncatedDodecadodecahedralGraph","LCF"]

GraphData["TruncatedDodecadodecahedralGraph","HamiltonianCycleCount"]

GraphData["TruncatedDodecadodecahedralGraph","LCFSignature"]

GraphData["TruncatedDodecadodecahedralGraph","LCFNotations"]

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

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

LCF compute random

FindRandomLCFNotation[GraphData["TruncatedDodecadodecahedralGraph"],TimeConstraint->120]

LCF compute 10^5

Tally[(lcf=LCF[GraphData["TruncatedDodecadodecahedralGraph"],10^5])[[All,2]]]//Timing

DeleteCases[lcf,{_,1}]

LCFGraph@@@DeleteCases[lcf,{_,1}]//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,{_,XX}]]}])//Timing

Length[gs]

LCF compute 10^6

Tally[(lcf=LCF[GraphData["TruncatedDodecadodecahedralGraph"],10^6])[[All,2]]]//Timing

DeleteCases[lcf,{_,1}]

LCFGraph@@@DeleteCases[lcf,{_,1}]//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|2}],Last],{2}],{2}],
(* order-1 bilateral only *)
DeleteMissing[BilateralLCFGraph@@@Cases[lcf,{_,2}]]}])//Timing

Length[gs]

LCF compute 10^7

Tally[(lcf=LCF[GraphData["TruncatedDodecadodecahedralGraph"],10^7])[[All,2]]]//Timing

DeleteCases[lcf,{_,1|2}]

MaxMemoryUsed[]/10.^9 "GB"

LCFGraph@@@DeleteCases[lcf,{_,1|2}]//StyleGraphs

Tally[LCFNotation[#][[-1]]&/@(gs=NiceLCFGraphs[lcf,3])]//Timing

Length[gs]

gs

BilateralGraphEmbeddingQ/@gs

Tally[LCFNotation[#][[-1]]&/@(gs=NiceLCFGraphs[lcf,4,3])]//Timing

Length[gs]

gs

BilateralGraphEmbeddingQ/@gs

LCF compute all

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

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

MaxMemoryUsed[]/10.^9 "GB"

Tally[(lcf=ReadProperty["LCFNotations",GraphNameToFileName["TruncatedDodecadodecahedralGraph",".m.gz"]])[[All,2]]]//Timing

DeleteCases[lcf,{_,1}]

LCFGraph@@@DeleteCases[lcf,{_,1}]//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["TruncatedDodecadodecahedralGraph","UnitDistance"]

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

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

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

UnitDistance by refinement

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

UnitDistanceGraphEmbeddingQ[%]

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

Select[%,UnitDistanceGraphEmbeddingQ]

UnitDistance by refinement of LCF embeddings

gs={,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,};

UnitDistanceEmbeddingRefine[Annotate[#,VertexCoordinates->N[GraphEmbedding[#]]],MaxIterations->500]&/@gs

Select[%,UnitDistanceGraphEmbeddingQ]

UnitDistance by FindUnitDistanceEmbedding

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

FindUnitDistanceEmbedding[GraphData["TruncatedDodecadodecahedralGraph"],MaxIterations->5000,"ReturnWithMessage"->False]//Quiet//Timing

UnitDistance by FindSubgraphUnitDistanceEmbedding

l={"TruncatedDodecadodecahedralGraph",FindSubgraphUnitDistanceEmbedding[GraphData["TruncatedDodecadodecahedralGraph"],TimeConstraint->300,"Results"->All]//Timing}

gs=SortBy[UniqueEmbeddings[l],Replace[RectilinearCrossingCount[#],Infinity->0]&]

Matchstick

GraphData["TruncatedDodecadodecahedralGraph","Matchstick"]

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

3D default

Graph3D[GraphData["TruncatedDodecadodecahedralGraph","Edges"]]

3D All

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

3D UnitDistance construction from uniform polyhedron

emb=GraphData["TruncatedDodecadodecahedralGraph","PolyhedralEmbeddings"]

PolyhedronGraph[PolyhedronData[#,"Polyhedron"]]&/@emb

3D UnitDistance

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

3D Polyhedron

GraphData["TruncatedDodecadodecahedralGraph","Polyhedral"]

GraphData["TruncatedDodecadodecahedralGraph","Graph",{"3D","Polyhedron"}]

GraphData

GraphDataClassString

GraphDataClassString["TruncatedDodecadodecahedralGraph"]

GraphDataString

file=OpenWrite["~/polygraphs.m"]

g=PolyhedronGraph[PolyhedronData["TruncatedDodecadodecahedron","Polyhedron"]]

lowercasedecamel[s_]:=StringTrim[StringReplace[s,RegularExpression["([A-Z])"]:>" "<>ToLowerCase["$1"]]]

PolyhedronNameToGraphName[s_]:=StringReplace[s,"dron"->"dralGraph"]

With[
{
stdname="TruncatedDodecadodecahedron",
altnames={}
},
WriteString[file,GraphDataString[g,
"StandardName"->PolyhedronNameToGraphName@stdname,
"AlternateStandatdNames"->PolyhedronNameToGraphName/@altnames,
"Name"->lowercasedecamel@stdname,
"AlternateNames"->lowercasedecamel/@PolyhedronNameToGraphName/@altnames,
"Information"->stdname,
"Classes"->{"UniformSkeleton"},
"Skip"->{"ConnectedInducedSubgraphPolynomial","ConnectedInducedSubgraphs","LowerMatchingNumber","MaximumIndependentVertexSets","TuttePolynomial"},
TimeConstraint->10
]]]

Close [file]