Search Results for ""

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

A section of a graph obtained by finding its intersection with a plane.

The central point in a wheel graph W_n. The hub has degree n-1.

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...

In complex analysis, a branch (also called a sheet) is a portion of the range of a multivalued function over which the function is single-valued. Combining all the sheets ...

The word canonical is used to indicate a particular choice from of a number of possible conventions. This convention allows a mathematical object or class of objects to be ...

The cyclic group C_(11) is unique group of group order 11. An example is the integers modulo 11 under addition (Z_(11)). No modulo multiplication group is isomorphic to ...

C_3 is the unique group of group order 3. It is both Abelian and cyclic. Examples include the point groups C_3, C_(3v), and C_(3h) and the integers under addition modulo 3 ...