Great Snub Dodecicosidodecahedral Graph

Author

Eric W. Weisstein
September 5, 2023

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

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

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

Graphics

GraphicsRow[GraphData["GreatSnubDodecicosidodecahedralGraph","Graph","All"]//StyleGraphs,ImageSize->400]

Embeddings

<<MathWorld`Graphs`

Names

GraphData["GreatSnubDodecicosidodecahedralGraph","StandardName"]

GraphData["GreatSnubDodecicosidodecahedralGraph","StandardNames"]

Primary

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

All

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

Inexact

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

Embedding types

GraphDataEmbeddings[GraphData["GreatSnubDodecicosidodecahedralGraph","EdgeList"]]

Default embedding

g=Graph@GraphData["GreatSnubDodecicosidodecahedralGraph","Edges"]

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

RecognizeGraph[g]

Degenerate

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

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

Perspective

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

Perspective construction

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

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

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

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

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

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

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

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

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

Bilateral

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

Circular

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

Planar

GraphData["GreatSnubDodecicosidodecahedralGraph","Planar"]

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

MinimalCrossing

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

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

MinimalCrossing construction

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

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

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

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

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

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

faces=ReverseSort@SymmetricallyDistinctFaces[g]

Tally[ReverseSort[Length/@faces]]

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

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

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

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

RecognizeGraph[g]

RectilinearCrossingCount[g]

Circulant

GraphData["GreatSnubDodecicosidodecahedralGraph","Circulant"]

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

Line graph

GraphData["GreatSnubDodecicosidodecahedralGraph","Line"]

LineGraphQ[GraphData["GreatSnubDodecicosidodecahedralGraph"]]//Timing

RootGraph

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

RootGraph[GraphData["GreatSnubDodecicosidodecahedralGraph"]]

Halin

GraphData["GreatSnubDodecicosidodecahedralGraph","Halin"]

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

Rigid

GraphData["GreatSnubDodecicosidodecahedralGraph","Rigid"]

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

Flexible

GraphData["GreatSnubDodecicosidodecahedralGraph","Flexible"]

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

LCF

GraphData["GreatSnubDodecicosidodecahedralGraph","LCF"]

GraphData["GreatSnubDodecicosidodecahedralGraph","HamiltonianCycleCount"]

GraphData["GreatSnubDodecicosidodecahedralGraph","LCFSignature"]

GraphData["GreatSnubDodecicosidodecahedralGraph","LCFNotations"]

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

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

LCF compute random

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

LCF compute 10^5

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

MaxMemoryUsed[]/10.^9 "GB"

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]

LCF compute 10^6

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

MaxMemoryUsed[]/10.^9 "GB"

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]

LCF compute 10^7

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

MaxMemoryUsed[]/10.^9 "GB"

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]

LCF compute all

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

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

MaxMemoryUsed[]/10.^9 "GB"

Tally[(lcf=ReadProperty["LCFNotations",GraphNameToFileName["GreatSnubDodecicosidodecahedralGraph",".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["GreatSnubDodecicosidodecahedralGraph","UnitDistance"]

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

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

UnitDistance by refinement

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

RecognizeGraph@ContractCoincidentVertices@

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

UnitDistance by FindUnitDistanceEmbedding

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

Matchstick

GraphData["GreatSnubDodecicosidodecahedralGraph","Matchstick"]

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

3D default

Graph3D[GraphData["GreatSnubDodecicosidodecahedralGraph","Edges"]]

3D UnitDistance construction from uniform polyhedron

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

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

3D All

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

3D UnitDistance

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

3D Polyhedron

GraphData["GreatSnubDodecicosidodecahedralGraph","Polyhedral"]

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

Properties

PolyhedralEmbeddings

GraphData["GreatSnubDodecicosidodecahedralGraph","PolyhedralEmbeddings"]

GraphData

GraphDataClassString

GraphDataClassString["GreatSnubDodecicosidodecahedralGraph"]

GraphDataString

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

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

RecognizeGraph@g

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

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

With[
{
stdname="GreatSnubDodecicosidodecahedron",
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","TuttePolynomial"},
TimeConstraint->10
]]]

Close [file]