Banner Graph

Author

Eric W. Weisstein
October 30, 2024

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

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

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

Embeddings

<<MathWorld`Graphs`

Names

GraphData["BannerGraph","StandardName"]

GraphData["BannerGraph","StandardNames"]

Primary

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

All

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

Inexact

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

Embedding types

GraphDataEmbeddings[GraphData["BannerGraph"]]

Default embedding

GraphPlot[Graph[GraphData["BannerGraph","VertexList"],GraphData["BannerGraph","Edges"]]]

v=Append[CirclePoints[{1,Pi/2},4],{0,0}];
g=Graph[Range@Length@v,UndirectedEdge@@@{e[5,4,1,2,3,4]},VertexCoordinates->v,VertexLabels->Automatic]

RecognizeGraph@g

Degenerate

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

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

GeneralizedPetersen

GraphData["BannerGraph","Graph","GeneralizedPetersen"]//StyleGraphs

IGraph

GraphData["BannerGraph","Graph","IGraph"]//StyleGraphs

Bilateral

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

Grid[DeleteCases[Monitor[{g=#,BilateralGraphEmbeddingTypes[#],GraphSymmetryGroup[#]}&/@GraphData["BannerGraph","Graph","All"],g],{_,_,TransformationGroup[{}]}],Dividers->All,Alignment->{{Center,{Left}}}]

Circular

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

Circular construction

GraphData["BannerGraph","Hamiltonian"]

GraphData["BannerGraph","LCF"]

GraphData["BannerGraph","HamiltonianCycleCount"]

Planar

GraphData["BannerGraph","Planar"]

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

Planar construction

PlanarGraphEmbedding[GraphData["BannerGraph"],GraphLayout->#]&/@{"TutteLayout","DavidsonHarelLayout"}

Table[PlanarGraphEmbedding[GraphData["BannerGraph"]],10]

PlanarGraphEmbeddings

GraphData["BannerGraph","PlanarEmbeddingCount"]

(plemb=PlanarGraphEmbeddings[GraphData["BannerGraph"],Debug->True])//Timing

Length[plemb]

MinimalCrossing

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

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

MinimalCrossing construction

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

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

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

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

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

(cn=CrossingNumber[GraphData["BannerGraph"],TimeConstraint->86400])//AbsoluteTiming

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

faces=ReverseSort@SymmetricallyDistinctFaces[g]

Tally[ReverseSort[Length/@faces]]

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

Select[gs,GraphSymmetryGroup[#,AdditionalData->Join[Table[True,GraphData["BannerGraph","V"]],Table[False,cn]],SameTest->Equal]=!=TransformationGroup[{}]&]

Select[gs,Max[OuterFace[#]]<=GraphData["BannerGraph","V"]&]

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

Select[gs,GraphSymmetryGroup[#,AdditionalData->Join[Table[True,GraphData["BannerGraph","V"]],Table[False,cn]],SameTest->Equal]=!=TransformationGroup[{}]&]

(gs=Table[MinimalCrossingGraph[GraphData["BannerGraph"],"CrossingNumber"->cn,RandomSeed->i],{i,50}]//Union)//Timing

Select[gs,GraphSymmetryGroup[#,AdditionalData->Join[Table[True,GraphData["BannerGraph","V"]],Table[False,cn]],SameTest->Equal]=!=TransformationGroup[{}]&]

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

RecognizeGraph[g]

RectilinearCrossingCount[g]

RectilinearLocalCrossingCount[g]

MinimalLocalCrossing

GraphData["BannerGraph",{"LocalCrossingNumber","RectilinearLocalCrossingNumber"}]

GraphData["BannerGraph","Graph","MinimalLocalCrossing"]//StyleGraphs

MinimalRectilinearLocalCrossing

GraphData["BannerGraph",{"LocalCrossingNumber","RectilinearLocalCrossingNumber"}]

GraphData["BannerGraph","Graph","MinimalRectilinearLocalCrossing"]//StyleGraphs

Circulant

GraphData["BannerGraph","Circulant"]

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

Circulant construction

GraphData["BannerGraph","NotationRules","Circulant"]

(ci=CirculantIndices[GraphData["BannerGraph"]])//Timing

CirculantGraph1@@@ci

Cases[GraphData["BannerGraph","StandardNames"],{"Circulant",i_}:>i]

CirculantGraph1@@@%

Complement graph

compl=GraphData["BannerGraph","ComplementGraph","Name"]

GraphData[compl,"Graph","All"]

gs=GraphComplement/@%

Select[%,!DegenerateGraphEmbeddingQ[#]&]

Line graph

GraphData["BannerGraph","Line"]

LineGraphQ[GraphData["BannerGraph"]]//Timing

RootGraph

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

RootGraph[GraphData["BannerGraph"]]

RecognizeGraph[%]

Halin

GraphData["BannerGraph","Halin"]

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

Rigid

GraphData["BannerGraph","Rigid"]

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

Flexible

GraphData["BannerGraph","Flexible"]

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

LCF

GraphData["BannerGraph","LCF"]

GraphData["BannerGraph","HamiltonianCycleCount"]

GraphData["BannerGraph","LCFSignature"]

GraphData["BannerGraph","LCFNotations"]

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

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

UnitDistance

GraphData["BannerGraph","UnitDistance"]

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

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

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

UnitDistance by refinement

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

UnitDistanceGraphEmbeddingQ[%]

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

Select[%,UnitDistanceGraphEmbeddingQ]

UnitDistance by FindUnitDistanceEmbedding

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

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

UnitDistance by FindSubgraphUnitDistanceEmbedding

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

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

Matchstick

GraphData["BannerGraph","Matchstick"]

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

3D default

Graph3D[GraphData["BannerGraph","Edges"]]

3D construction

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

RecognizeGraph[g]

3D All

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

3D UnitDistance

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

3D Polyhedron

GraphData["BannerGraph","Polyhedral"]

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

GraphData

GraphDataClassString

GraphDataClassString["BannerGraph"]

GraphMatrixPlot

GraphMatrixPlot[GraphData@"BannerGraph"]