Graph details

Graph # 36257

Adjacency matrix

01111000
10000111
10011110
10101101
10110011
01110011
01101101
01011110

Adjacency list

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

HoG graph id

36257

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

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.