Graph details

Graph # 35465

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name


Graph submitted by

Gunnar Brinkmann

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3
Algebraic Connectivity 0.841 Laplacian Largest Eigenvalue 5.873
Average Degree 3 Longest Induced Cycle 20
Bipartite No Longest Induced Path 19
Chromatic Index 3 Matching Number 14
Chromatic Number 3 Maximum Degree 3
Circumference 28 Minimum Degree 3
Claw-Free No Minimum Dominating Set 8
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 42
Density 0.111 Number of Triangles 0
Diameter 5 Number of Vertices 28
Edge Connectivity 3 Planar No
Eulerian No Radius 4
Genus 2 Regular Yes
Girth 6 Second Largest Eigenvalue 2.159
Hamiltonian Yes Smallest Eigenvalue -2.873
Independence Number 13 Vertex Connectivity 3

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


Posted by Gunnar Brinkmann at Jul 20, 2020 3:37 PM.
A smallest graph with polyhedral embedding, but not in minimum genus

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