Graph details

Graph # 36251

Adjacency matrix

00011001
00000111
00011111
10100111
10100111
01111001
01111001
11111110

Adjacency list

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

HoG graph id

36251

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.99
Algebraic Connectivity 2.551 Laplacian Largest Eigenvalue 8
Average Degree 4.75 Longest Induced Cycle 4
Bipartite No Longest Induced Path 3
Chromatic Index 7 Matching Number 4
Chromatic Number 4 Maximum Degree 7
Circumference 8 Minimum Degree 3
Claw-Free No Minimum Dominating Set 1
Clique Number 4 Number of Components 1
Connected Yes Number of Edges 19
Density 0.679 Number of Triangles 16
Diameter 2 Number of Vertices 8
Edge Connectivity 3 Planar No
Eulerian No Radius 1
Genus 1 Regular No
Girth 3 Second Largest Eigenvalue 0.732
Hamiltonian Yes Smallest Eigenvalue -2.732
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.