Graph details

Graph # 36265

Adjacency matrix

0001001
0000101
0000011
1000111
0101011
0011101
1111110

Adjacency list

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

HoG graph id

36265

Graph name

\co{S_3 \cup K_1}

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.828
Algebraic Connectivity 1.697 Laplacian Largest Eigenvalue 7
Average Degree 3.429 Longest Induced Cycle 3
Bipartite No Longest Induced Path 3
Chromatic Index 6 Matching Number 3
Chromatic Number 4 Maximum Degree 6
Circumference 6 Minimum Degree 2
Claw-Free No Minimum Dominating Set 1
Clique Number 4 Number of Components 1
Connected Yes Number of Edges 12
Density 0.571 Number of Triangles 7
Diameter 2 Number of Vertices 7
Edge Connectivity 2 Planar Yes
Eulerian Yes Radius 1
Genus 0 Regular No
Girth 3 Second Largest Eigenvalue 0.618
Hamiltonian No Smallest Eigenvalue -1.828
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 4:17 PM.
Is the complement of a forbidden induced subgraph of the proper circular arc graph class.

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