Graph details

Graph # 48171

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Critical graph

Graph submitted by

Sancuan Zhang

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 6.421
Algebraic Connectivity 3.464 Laplacian Largest Eigenvalue 11.264
Average Degree 6.273 Longest Induced Cycle 10
Bipartite No Longest Induced Path 8
Chromatic Index 9 Matching Number 11
Chromatic Number 5 Maximum Degree 9
Circumference 22 Minimum Degree 4
Claw-Free No Minimum Dominating Set 5
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 69
Density 0.299 Number of Triangles 0
Diameter 3 Number of Vertices 22
Edge Connectivity 4 Planar No
Eulerian No Radius 2
Genus 8 Regular No
Girth 4 Second Largest Eigenvalue 1.936
Hamiltonian Yes Smallest Eigenvalue -4.33
Independence Number 9 Vertex Connectivity 4

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


Posted by Sancuan Zhang at Dec 14, 2021 4:39 PM.
A critical graph that has minimum degree strictly smaller than its degeneracy.

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