Graph details

Graph # 44051

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name


Graph submitted by

House of Graphs

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3
Algebraic Connectivity 0.364 Laplacian Largest Eigenvalue 5.695
Average Degree 3 Longest Induced Cycle Computation time out
Bipartite No Longest Induced Path Computation time out
Chromatic Index Computation time out Matching Number 125
Chromatic Number Computation time out Maximum Degree 3
Circumference Computation time out Minimum Degree 3
Claw-Free No Minimum Dominating Set Computation time out
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 375
Density 0.012 Number of Triangles 0
Diameter 8 Number of Vertices 250
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 8
Genus Computation time out Regular Yes
Girth 11 Second Largest Eigenvalue 2.636
Hamiltonian Computation time out Smallest Eigenvalue -2.695
Independence Number Computation time out Vertex Connectivity Computation time out

A table row rendered like this indicates that the graph is marked as being interesting for that invariant.


Posted by House of Graphs at Sep 21, 2020 4:03 PM.
Is a vertex-transitive cubic graph. See: P. Poto─Źnik, P. Spiga, G. Verret, Cubic vertex-transitive graphs on up to 1280 vertices, Journal of Symbolic Computation 50 (2013), 465-477.

You need to be logged in to be able to add comments.