Graph details

Graph # 48157

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id

48157

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.96
Algebraic Connectivity 0.598 Laplacian Largest Eigenvalue 9.503
Average Degree 4.632 Longest Induced Cycle 6
Bipartite No Longest Induced Path 8
Chromatic Index 8 Matching Number 9
Chromatic Number 3 Maximum Degree 8
Circumference 18 Minimum Degree 4
Claw-Free No Minimum Dominating Set 4
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 44
Density 0.257 Number of Triangles 26
Diameter 4 Number of Vertices 19
Edge Connectivity 4 Planar Yes
Eulerian Yes Radius 3
Genus 0 Regular No
Girth 3 Second Largest Eigenvalue 4.089
Hamiltonian No Smallest Eigenvalue -3.146
Independence Number 8 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 Nov 27, 2021 11:24 AM.
A 2-connected planar graph with circumference n-1 and minimum degree 4. See "J. Goedgebeur, T. Gringore, C.T. Zamfirescu, On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs, manuscript" for more details.

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