Search Results for ""

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

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

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

Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

A two-player game, also called crosscram, in which player H has horizontal dominoes and player V has vertical dominoes. The two players alternately place a domino on a board ...

The Eiffel Tower graph is the graph on 7 vertices illustrated above. (Note that Koren et al. (2003) use the term 'Eiffel Tower graph' to refer instead to the (3,2)-fan ...

For s>1, the Riemann zeta function is given by zeta(s) = sum_(n=1)^(infty)1/(n^s) (1) = product_(k=1)^(infty)1/(1-1/(p_k^s)), (2) where p_k is the kth prime. This is Euler's ...

Euler conjectured that at least n nth powers are required for n>2 to provide a sum that is itself an nth power. The conjecture was disproved by Lander and Parkin (1967) with ...

Exterior algebra is the algebra of the wedge product, also called an alternating algebra or Grassmann algebra. The study of exterior algebra is also called Ausdehnungslehre ...