Search Results for ""

A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...

A uniquely Hamiltonian graph is a graph possessing a single Hamiltonian cycle. Classes of uniquely Hamiltonian graphs include the cycle graphs C_n, Hanoi graphs H_n, ladder ...

A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...

Given two additive groups (or rings, or modules, or vector spaces) A and B, the map f:A-->B such that f(a)=0 for all a in A is called the zero map. It is a homomorphism in ...

When p is a prime number, then a p-group is a group, all of whose elements have order some power of p. For a finite group, the equivalent definition is that the number of ...

A number of interesting graphs are associated with the work of van Cleemput and Zamfirescu (2018). Two 13- and 15-node graphs, denoted alpha and beta respectively, were used ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

The conditional intensity lambda(t) associated to a temporal point process N is defined to be the expected infinitesimal rate at which events are expected to occur around ...

A statistical distribution whose variables can take on only discrete values. Abramowitz and Stegun (1972, p. 929) give a table of the parameters of most common discrete ...

The intensity measure mu of a point process X relative to a Borel set B subset R^d is defined to be the expected number of points of X falling in B. Symbolically, ...