Graph details

Graph # 33984

Adjacency matrix

01111000000000
10001000000011
10011000000001
10101000000001
11110000000000
00000011100001
00000100011010
00000100010110
00000100001110
00000011001100
00000010110100
00000001111000
01000011100000
01110100000000

Adjacency list

1: 2 3 4 5
2: 1 5 13 14
3: 1 4 5 14
4: 1 3 5 14
5: 1 2 3 4
6: 7 8 9 14
7: 6 10 11 13
8: 6 10 12 13
9: 6 11 12 13
10: 7 8 11 12
11: 7 9 10 12
12: 8 9 10 11
13: 2 7 8 9
14: 2 3 4 6

HoG graph id

33984

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

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 26, 2019 12:34 PM.
A 4-regular nut graph. See "P.W. Fowler, J.B. Gauci, J. Goedgebeur, T. Pisanski and I. Sciriha, Existence of d-regular nut graphs for d at most 11, submitted" for more information.

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