Disdyakis Dodecahedral Graph

Author

Eric W. Weisstein
April 30, 2021

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

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

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

Graph

All

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

Degenerate

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

LCF

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

MinimalCrossing

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

Perspective

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

Planar

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

UnitDistance

GraphData["DisdyakisDodecahedralGraph","UnitDistance"]

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

3-D

GraphData["DisdyakisDodecahedralGraph","Graph","3D"]//StyleGraphs

Embeddings

GraphDataEmbeddings[GraphData["DisdyakisDodecahedralGraph","EdgeList"]]

Perspective projections

PolyhedronProjectionGraph[PolyhedronData["DisdyakisDodecahedron","Polyhedron"],#,"Simplification"->FullSimplify]&/@{{0,1,0},{1,0,1},{2,1,1},{1,(1/41) (17-(Sqrt[2])),0},{1,(1/7) (10+(Sqrt[2])),1,ArcTan[(2/(Sqrt[2+((Sqrt[2])/5)]))]},{(14/(26+3 (Sqrt[2]))),1,1},{1,1,1}}

GraphData["DisdyakisDodecahedralGraph","Graph","Perspective"]

Properties

Classes

GraphData[g,"Classes"]

Matrices

GraphicsRow[GraphMatrixPlot[GraphData["DisdyakisDodecahedralGraph"]]]

Properties

GraphData[g,"Missing"]

GraphData[g,{"V","M"}]

TableForm[GraphDataTable[g,x],TableDepth->2]//TraditionalForm

Embeddings by Projection

PolyhedronData[poly]

ShowGraph[SkeletonGraph[PolyhedronData[poly,"Faces"]//Normal,2],VertexStyle->Disk[.03],ImageSize->200]

GraphData

GraphClasses

GraphClassString[g]