Graph details

Graph # 34066

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Large Niel Graph

Graph submitted by

Niklas Spangenberg

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3
Algebraic Connectivity 0.096 Laplacian Largest Eigenvalue 6
Average Degree 3 Longest Induced Cycle 22
Bipartite Yes Longest Induced Path 31
Chromatic Index 3 Matching Number 22
Chromatic Number 2 Maximum Degree 3
Circumference 30 Minimum Degree 3
Claw-Free No Minimum Dominating Set 12
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 66
Density 0.07 Number of Triangles 0
Diameter 9 Number of Vertices 44
Edge Connectivity 2 Planar Yes
Eulerian No Radius 7
Genus 0 Regular Yes
Girth 4 Second Largest Eigenvalue 2.904
Hamiltonian No Smallest Eigenvalue -3
Independence Number 22 Vertex Connectivity 2

A table row rendered like this indicates that the graph is marked as being interesting for that invariant.


Posted by Niklas Spangenberg at Oct 19, 2019 1:47 PM.
This graph shows that you need 3-connect for Barnette's conjecture.

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