Search Results for ""

A set of positive integers is called weakly triple-free if, for any integer x, the set {x,2x,3x} !subset= S. For example, all subsets of {1,2,3,4,5} are weakly triple-free ...

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, then there exists a B_3 in S such ...

The problem of forecasting future values X_(t+tau) (tau>0) of a weakly stationary process {X_t} from the known values X_s (s<=t).

Let pi be a unitary representation of a group G on a separable Hilbert space, and let R(pi) be the smallest weakly closed algebra of bounded linear operators containing all ...

An infinite sequence {a_i} of positive integers is called strongly independent if any relation sumepsilon_ia_i, with epsilon_i=0, +/-1, or +/-2 and epsilon_i=0 except ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...