# Graph details

 0110 1001 1001 0110

 1: 2 3 2: 1 4 3: 1 4 4: 2 3

674

Square Graph

GraPHedron

## Invariant values

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

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

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.

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

Posted by House of Graphs at Jan 29, 2019 9:24 AM.
A connected integral graph. A graph is called integral if all of its eigenvalues of its adjacency matrix are integral. See "Krzysztof T. ZwierzyĆski, Generating Integral Graphs Using PRACE Research Infrastructure" for more information.