Graph details

Graph # 36267

Adjacency matrix

0001101
0001011
0000111
1100110
1011011
0111101
1110110

Adjacency list

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

HoG graph id

36267

Graph name

co-eiffeltower

Graph submitted by

Diego de Estrada

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 4.159
Algebraic Connectivity 2.586 Laplacian Largest Eigenvalue 6.618
Average Degree 4 Longest Induced Cycle 4
Bipartite No Longest Induced Path 3
Chromatic Index 5 Matching Number 3
Chromatic Number 4 Maximum Degree 5
Circumference 7 Minimum Degree 3
Claw-Free No Minimum Dominating Set 2
Clique Number 4 Number of Components 1
Connected Yes Number of Edges 14
Density 0.667 Number of Triangles 9
Diameter 2 Number of Vertices 7
Edge Connectivity 3 Planar Yes
Eulerian No Radius 2
Genus 0 Regular No
Girth 3 Second Largest Eigenvalue 0.735
Hamiltonian Yes Smallest Eigenvalue -2.241
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 Diego de Estrada at Sep 1, 2020 4:26 PM.
Is a minimal 3-proper-thin graph, with respect to the induced subgraph partial order.

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