Search Results for ""

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 (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

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.

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

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

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