Graph details

Graph # 45599

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name


Graph submitted by

Krystal Guo

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.873
Algebraic Connectivity 2 Laplacian Largest Eigenvalue 8
Average Degree 3.75 Longest Induced Cycle 10
Bipartite Yes Longest Induced Path 8
Chromatic Index 5 Matching Number 6
Chromatic Number 2 Maximum Degree 5
Circumference 12 Minimum Degree 3
Claw-Free No Minimum Dominating Set 4
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 30
Density 0.25 Number of Triangles 0
Diameter 3 Number of Vertices 16
Edge Connectivity 3 Planar No
Eulerian No Radius 3
Genus 1 Regular No
Girth 4 Second Largest Eigenvalue 1.732
Hamiltonian No Smallest Eigenvalue -3.873
Independence Number 10 Vertex Connectivity 3

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


Posted by Krystal Guo at Mar 31, 2021 6:13 PM.
Bi-regular with degrees (3,5). It is edge-transitive and can be constructed as the dual of the line graph of the Petersen Graph embedded in the projective plane with 10 faces of degree 3 and 6 faces of degree 5.

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