TOPICS
Search

Search Results for ""


261 - 270 of 764 for Complete InductionSearch Results
The catacaustic of the Tschirnhausen cubic with parametric representation x = 3(t^2-3) (1) y = t(t^2-3) (2) with radiant point at (-8,0) is the semicubical parabola with ...
If the Tutte polynomial T(x,y) of a graph G is given by sumt_(rs)x^ry^s, then the matrix (t_(rs)) is called the rank matrix of G. For example, the Tutte matrix of the ...
The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.
A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).
The Akhmim wooden tablet, often called the Cairo wooden tablet, is a document dating to 2000 BC, near the beginning of the Egyptian Middle Kingdom. It is housed in the Egypt ...
An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...
If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...
An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...
A sequence of primes q_1<q_2<...<q_k is a Cunningham chain of the first kind (second kind) of length k if q_(i+1)=2q_i+1 (q_(i+1)=2q_i-1) for i=1, ..., k-1. Cunningham primes ...
A double-toroidal graph is a graph with graph genus 2 (West 2000, p. 266). Planar and toroidal graphs are therefore not double-toroidal. Some known double-toroidal graphs on ...
1 ... 24|25|26|27|28|29|30 ... 77 Previous Next

...