Search Results for ""

A ternary diagram is a triangular diagram which displays the proportion of three variables that sum to a constant and which does so using barycentric coordinates. The ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

A graph vertex in a graph is said to be an even node if its vertex degree is even.

The number of staircase walks on a grid with m horizontal lines and n vertical lines is given by (m+n; m)=((m+n)!)/(m!n!) (Vilenkin 1971, Mohanty 1979, Narayana 1979, Finch ...

The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...

A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...

The Kirchhoff index Kf, also simply called the resistance and denoted R (Lukovits et al. 1999), of a connected graph G on n nodes is defined by ...

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...