Construction of strongly balanced uniform repeated measurements designs (Q1101166): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0378-3758(88)90041-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968941267 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian decomposition of lexicographic product / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3038431 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4060237 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4159097 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Circular balanced repeated measurements designs / rank | |||
Normal rank | |||
Latest revision as of 15:52, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Construction of strongly balanced uniform repeated measurements designs |
scientific article |
Statements
Construction of strongly balanced uniform repeated measurements designs (English)
0 references
1988
0 references
Strongly balanced uniform repeated measurements designs when the number of treatments is 0, 1 or 3 modulo 4 are constructed. The methods used are the methods of differences and Hamiltonian decomposition of the lexicographic product of two graphs.
0 references
circular model
0 references
universal optimality
0 references
difference-set
0 references
cycles
0 references
graph decomposition
0 references
Hamiltonian circuits
0 references
Strongly balanced uniform repeated measurements designs
0 references
methods of differences
0 references
Hamiltonian decomposition of the lexicographic product of two graphs
0 references
