Graph details

Graph # 44082

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.734 Laplacian Largest Eigenvalue 5.628
Average Degree 3 Longest Induced Cycle 21
Bipartite No Longest Induced Path 20
Chromatic Index 3 Matching Number 15
Chromatic Number 3 Maximum Degree 3
Circumference 30 Minimum Degree 3
Claw-Free No Minimum Dominating Set 9
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 45
Density 0.103 Number of Triangles 0
Diameter 5 Number of Vertices 30
Edge Connectivity 3 Planar No
Eulerian No Radius 4
Genus 3 Regular Yes
Girth 7 Second Largest Eigenvalue 2.266
Hamiltonian Yes Smallest Eigenvalue -2.628
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 Dec 16, 2020 4:43 PM.
pl_2_fac A graph with a 2-planarizing 2-factor

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