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

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

Let A be an n×n matrix with complex or real elements with eigenvalues lambda_1, ..., lambda_n. Then the spectral radius rho(A) of A is rho(A)=max_(1<=i<=n)|lambda_i|, i.e., ...

The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...

The classic treatise in geometry written by Euclid and used as a textbook for more than 1000 years in western Europe. An Arabic version The Elements appears at the end of the ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

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 lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...