Graph details

Graph # 52

Adjacency matrix

0000
0000
0000
0000

Adjacency list

1:
2:
3:
4:

HoG graph id

52

Graph name

n/a

Graph submitted by

GraPHedron

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic Yes Index 0
Algebraic Connectivity 0 Laplacian Largest Eigenvalue 0
Average Degree 0 Longest Induced Cycle undefined
Bipartite Yes Longest Induced Path 0
Chromatic Index 0 Matching Number 0
Chromatic Number 1 Maximum Degree 0
Circumference 0 Minimum Degree 0
Claw-Free Yes Minimum Dominating Set 4
Clique Number 1 Number of Components 4
Connected No Number of Edges 0
Density 0 Number of Triangles 0
Diameter infinity Number of Vertices 4
Edge Connectivity 0 Planar Yes
Eulerian No Radius undefined
Genus undefined Regular Yes
Girth undefined Second Largest Eigenvalue 0
Hamiltonian No Smallest Eigenvalue 0
Independence Number 4 Vertex Connectivity 0

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

Comments

Posted by GraPHedron at Mar 28, 2012 11:56 AM.
Is an extremal graph found by GraPHedron. See "H. Melot, Facet defining inequalities among graph invariants: the system graphedron. Discrete Applied Mathematics 156 (2008), 1875-1891" for more information.

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