Graph details

Graph # 34073

Adjacency matrix

01110000
10010010
10010001
11100000
00000111
00001011
01001100
00101100

Adjacency list

1: 2 3 4
2: 1 4 7
3: 1 4 8
4: 1 2 3
5: 6 7 8
6: 5 7 8
7: 2 5 6
8: 3 5 6

HoG graph id

34073

Graph name

special c3

Graph submitted by

Sancuan Zhang

Invariant values

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

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

Comments

Posted by Sancuan Zhang at Nov 18, 2019 6:54 AM.
Basis of a counterexample graph.

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