Search Results for ""

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

If f(z) is regular and of the form O(e^(k|z|)) where k<pi, for R[z]>=0, and if f(z)=0 for z=0, 1, ..., then f(z) is identically zero.

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined ...

"Neighborhood" is a word with many different levels of meaning in mathematics. One of the most general concepts of a neighborhood of a point x in R^n (also called an ...

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

A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

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