Graph details

Graph # 36253

Adjacency matrix

00011100
00010111
00001111
11001011
10110011
11100011
01111100
01111100

Adjacency list

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

HoG graph id

36253

Graph name

n/a

Graph submitted by

House of Graphs

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 4.59
Algebraic Connectivity 2.809 Laplacian Largest Eigenvalue 7.504
Average Degree 4.5 Longest Induced Cycle 5
Bipartite No Longest Induced Path 3
Chromatic Index 5 Matching Number 4
Chromatic Number 4 Maximum Degree 5
Circumference 8 Minimum Degree 3
Claw-Free No Minimum Dominating Set 2
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 18
Density 0.643 Number of Triangles 11
Diameter 2 Number of Vertices 8
Edge Connectivity 3 Planar No
Eulerian No Radius 2
Genus 1 Regular No
Girth 3 Second Largest Eigenvalue 0.874
Hamiltonian Yes Smallest Eigenvalue -2.72
Independence Number 3 Vertex Connectivity 3

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

Comments

Posted by House of Graphs at Aug 31, 2020 1:39 PM.
Is a minimal 4-proper-thin graph, with respect to the induced subgraph partial order.

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