Search Results for ""

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

Let (A,<=) be a partially ordered set. Then an element m in A is said to be maximal if, for all a in A, m!<=a. Alternatively, an element m in A is maximal such that if m<=a ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

The ring of integers of a number field K, denoted O_K, is the set of algebraic integers in K, which is a ring of dimension d over Z, where d is the extension degree of K over ...

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

A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.

Let T be a maximal torus of a group G, then T intersects every conjugacy class of G, i.e., every element g in G is conjugate to a suitable element in T. The theorem is due to ...