Graph details

Graph # 1082

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Four Squares

Graph submitted by


Invariant values

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

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


Posted by MathWorld at Mar 28, 2012 11:57 AM.
Source: MathWorld and GraphData in Mathematica.

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