Graph details

Graph # 49237

Adjacency matrix

010010010
100010001
000101100
001001100
110000011
001100011
001100011
100011101
010011110

Adjacency list

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

HoG graph id

49237

Graph name

Faren's graph

Graph submitted by

Henry Simmons

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.96
Algebraic Connectivity 0.963 Laplacian Largest Eigenvalue 6.787
Average Degree 3.778 Longest Induced Cycle 4
Bipartite No Longest Induced Path 4
Chromatic Index 5 Matching Number 4
Chromatic Number 3 Maximum Degree 5
Circumference 9 Minimum Degree 3
Claw-Free No Minimum Dominating Set 2
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 17
Density 0.472 Number of Triangles 8
Diameter 3 Number of Vertices 9
Edge Connectivity 3 Planar Yes
Eulerian No Radius 2
Genus 0 Regular No
Girth 3 Second Largest Eigenvalue 2.347
Hamiltonian Yes Smallest Eigenvalue -2.566
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 Henry Simmons at Jul 12, 2022 9:08 PM.
graph made from degree sequence favoring edges between higher degree vertices, that results in a graph with a smaller chromatic number than another graph on the same degree sequence.

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