Graph details

Graph # 45690

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id

45690

Graph name

n/a

Graph submitted by

Kolja Knauer

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 6
Algebraic Connectivity 1.836 Laplacian Largest Eigenvalue 10.391
Average Degree 6 Longest Induced Cycle Computation time out
Bipartite No Longest Induced Path Computation time out
Chromatic Index Computation time out Matching Number 42
Chromatic Number Computation time out Maximum Degree 6
Circumference 84 Minimum Degree 6
Claw-Free No Minimum Dominating Set Computation time out
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 252
Density 0.072 Number of Triangles 0
Diameter 4 Number of Vertices 84
Edge Connectivity Computation time out Planar Computation time out
Eulerian Yes Radius 4
Genus Computation time out Regular Yes
Girth 4 Second Largest Eigenvalue 4.164
Hamiltonian Computation time out Smallest Eigenvalue -4.391
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.

Comments

Posted by Kolja Knauer at Sep 5, 2021 3:01 PM.
A small prime minimal Cayley graph of chromatic number 4. It is a Cayley graph of (Z7 ⋊ Z4) ⋊ Z3 wrt one generators of order 4 and two of order 7.

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