Search Results for ""

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...

The term rectification is sometimes used to refer to the determination of the length of a curve. Rectification also refers to the operation which converts the midpoints of ...

Given a triangle DeltaABC and the excentral triangle DeltaJ_AJ_BJ_C, define the A^'-vertex of the hexyl triangle as the point in which the perpendicular to AB through the ...

A variation of chess involving a change in the form of the board, the rules of play, or the pieces used. For example, the normal rules of chess can be used but with a ...

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...

The ABC (atom-bond connectivity) spectral radius rho_(ABC) of a graph is defined as the largest eigenvalue of its ABC matrix. Chen (2019) showed that for a tree on 3 or more ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

A degree set is a set of integers that make up a degree sequence. Any set of positive integers is the degree set for some graph, because any odd integer from that set can be ...

Let R+B be the number of monochromatic forced triangles (where R and B are the number of red and blue triangles) in an extremal graph. Then R+B=(n; 3)-|_1/2n|_1/4(n-1)^2_|_|, ...

Let a convex polygon be inscribed in a circle and divided into triangles from diagonals from one polygon vertex. The sum of the radii of the circles inscribed in these ...