Search Results for ""

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...

A fusene is a simple planar 2-connected graph embedded in the plane with all vertices of degree 2 or 3, all bounded faces (not necessarily regular) hexagons, and all vertices ...

The helm graph H_n is the graph obtained from an n-wheel graph by adjoining a pendant edge at each node of the cycle. Helm graphs are graceful (Gallian 2018), with the odd ...

A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...

The number of different triangles which have integer side lengths and perimeter n is T(n) = P(n,3)-sum_(1<=j<=|_n/2_|)P(j,2) (1) = [(n^2)/(12)]-|_n/4_||_(n+2)/4_| (2) = ...

A Heronian triangle is a triangle having rational side lengths and rational area. The triangles are so named because such triangles are related to Heron's formula ...

Two slant triangular prisms fused together.

A right-angled parallelepiped with dimensions a×ab×abc, where a, b, and c are integers.

The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.

The square antiprism is the antiprism with square bases whose dual is the tetragonal trapezohedron. The square antiprism has 10 faces. The square antiprism with unit edge ...