B) a graph we mean a finite undirected connected graph of order p, p 2 2, with no loops or multrple edges. A finite non-decreasing sequence S : s,. s:.. . , sp p \* 2. of positive integers is an eccentric sequence if there exists a graph G with vertex set V(G) = {ul, o\_, . . . . u,,} such that for
Eccentric sequences and triangle sequences of block designs
β Scribed by Mehdi Behzad; Ebadollah S. Mahmoodian
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 549 KB
- Volume
- 127
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We construct several new families of orthogonal designs related to one of the weighing matrix conjectures. We also construct some new complementary quadruples (A; B; C; D ) of (0, fi}sequences of length n and total weight w, denoted as CTQ(n, w). The word complementary refers to the fact that the su
We propose some methods for multiplying the length and type of sequences with elements on a set of commuting variables which have zero non-periodic autocorrelation function. We use base sequences of lengths n+1, n+1, n, n in order to construct four directed sequences of lengths n+1, n+1, n, n and ty
We have used an improved block-entropy measure in order to gain some further insights into the short-range correlations present in whole chromosomes of S. cerevisiae, viruses and organelles and very large genomic regions of E. coli. Although DNA sequences are largely inhomogeneous and word frequenci
A fixing block in an irreducible word is a square, segment of the form XX, and the period is the length of X. An occurrence of a block C in an irr~ucfole word, W = XCY, is called a chain if XA having an infinite/rreducible extension implies A is an initial segment of C. The length of such a chain is