Search Results for ""

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...

The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...

There are a number of attractive polyhedron compounds of two cubes. The first (left figures) is obtained by allowing two cubes to share opposite polyhedron vertices then ...

A cubic curve is an algebraic curve of curve order 3. An algebraic curve over a field K is an equation f(X,Y)=0, where f(X,Y) is a polynomial in X and Y with coefficients in ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

A 3-cusped hypocycloid, also called a tricuspoid. The deltoid was first considered by Euler in 1745 in connection with an optical problem. It was also investigated by Steiner ...

The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It is isomorphic to the complete tripartite graph K_(1,1,2) ...

The dihedral group D_3 is a particular instance of one of the two distinct abstract groups of group order 6. Unlike the cyclic group C_6 (which is Abelian), D_3 is ...

The Dirichlet eta function is the function eta(s) defined by eta(s) = sum_(k=1)^(infty)((-1)^(k-1))/(k^s) (1) = (1-2^(1-s))zeta(s), (2) where zeta(s) is the Riemann zeta ...