Search Results for ""

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

Eigenvalues are a special set of scalars associated with a linear system of equations (i.e., a matrix equation) that are sometimes also known as characteristic roots, ...

A prime p is said to be a Sophie Germain prime if both p and 2p+1 are prime. The first few Sophie Germain primes are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, ... (OEIS ...

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 ...

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 ...

The number of inward directed graph edges from a given graph vertex in a directed graph.

If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

The shortest path-spanning tree from a graph vertex of a graph.