Graph details

Graph # 36261

Adjacency matrix

000110
000101
000011
110011
101101
011110

Adjacency list

1: 4 5
2: 4 6
3: 5 6
4: 1 2 5 6
5: 1 3 4 6
6: 2 3 4 5

HoG graph id

36261

Graph name

S_3

Graph submitted by

Diego de Estrada

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.236
Algebraic Connectivity 1.697 Laplacian Largest Eigenvalue 5.303
Average Degree 3 Longest Induced Cycle 3
Bipartite No Longest Induced Path 3
Chromatic Index 4 Matching Number 3
Chromatic Number 3 Maximum Degree 4
Circumference 6 Minimum Degree 2
Claw-Free Yes Minimum Dominating Set 2
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 9
Density 0.6 Number of Triangles 4
Diameter 2 Number of Vertices 6
Edge Connectivity 2 Planar Yes
Eulerian Yes Radius 2
Genus 0 Regular No
Girth 3 Second Largest Eigenvalue 0.618
Hamiltonian Yes Smallest Eigenvalue -1.618
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 Diego de Estrada at Sep 1, 2020 3:39 PM.
Is a forbidden induced subgraph of the proper interval graph class.

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