Search Results for ""

Lauricella functions are generalizations of the Gauss hypergeometric functions to multiple variables. Four such generalizations were investigated by Lauricella (1893), and ...

A topological space, also called an abstract topological space, is a set X together with a collection of open subsets T that satisfies the four conditions: 1. The empty set ...

The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

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

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

The cyclic group C_(10) is the unique Abelian group of group order 10 (the other order-10 group being the non-Abelian D_5). Examples include the integers modulo 10 under ...

C_6 is one of the two groups of group order 6 which, unlike D_3, is Abelian. It is also a cyclic. It is isomorphic to C_2×C_3. Examples include the point groups C_6 and S_6, ...

Barnette's conjecture asserts that every 3-connected bipartite cubic planar graph is Hamiltonian. The only graph on nine or fewer vertices satisfying Barnette's conditions is ...