Titlebook: Combinatorial Mathematics VII; Proceedings of the S Robert W. Robinson,George W. Southern,Walter D. Wa Conference proceedings 1980 Springer

APO

无辜

Graphs with regular neighbourhoods,there are only two vertex degrees, and the vertices of each degree induce a regular subgraph of G. The eigenvalues of each of these subgraphs determine the eigenvalues of the other. We are able to construct non-trivial NR-regular graphs with 4, 8, 28 and 32 vertices, and conjecture that there are infinitely many more.

Cumulus

Sciatica

Doubly and orthogonally resolvable quadruple systems,∩ γ′.|⩽1 for all i and j. This paper contains constructions of (2,3)(1,1)-doubly resolvable quadruple systems of orders v = 20,32,44, 68,80 and 104; a(2,3)-resolvable quadruple system of order 128; and some sets of mutually orthogonal resolutions of quadruple systems of all the above orders.

步履蹒跚

Degree sequences uniquely realisable by hypergraphs,ices. Let F(s) be the set of all finite sequences of non-negative integers which have a unique realisation in the set of all s-uniform hypergraphs, and let F(s.) be the corresponding set for s.-hypergraphs. Hakimi determined F(2), and F(s) can be derived from a result of Koren. Here we determine F(2

curriculum

On generating spatial configurations with identical interpoint distance distributions,yet have identical interpoint distance distributions. In this paper we demonstrate a method for doing this with any set of points or figures and demonstrate the application of the finding to image processing studies.

和音

extrovert

Determining the asymptotic number of phylogenetic trees,points have been labelled with disjoint subsets of the labelling set. Every point of degree less than three must have a nonempty label. Formulas are found for the exact numbers of phylogenetic trees with n labels, and numerical results are presented for selected n⩽40. The asymptotic behaviour of the

废墟

碳水化合物