Graph details

Graph # 35471

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id

35471

Graph name

n/a

Graph submitted by

Gunnar Brinkmann

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3
Algebraic Connectivity 0.564 Laplacian Largest Eigenvalue 5.803
Average Degree 3 Longest Induced Cycle 17
Bipartite No Longest Induced Path 18
Chromatic Index 3 Matching Number 13
Chromatic Number 3 Maximum Degree 3
Circumference 26 Minimum Degree 3
Claw-Free No Minimum Dominating Set 7
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 39
Density 0.12 Number of Triangles 0
Diameter 5 Number of Vertices 26
Edge Connectivity 3 Planar No
Eulerian No Radius 4
Genus 1 Regular Yes
Girth 4 Second Largest Eigenvalue 2.436
Hamiltonian Yes Smallest Eigenvalue -2.803
Independence Number 12 Vertex Connectivity 3

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

Comments

Posted by Gunnar Brinkmann at Jul 20, 2020 4:59 PM.
pol_embed
A smallest graph with polyhedral embeddings in more than one genus

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