No label defined (Q3784081)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4047737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4047737 |
Statements
1987
0 references
graph design
0 references
balanced incomplete block design
0 references
BIBD
0 references
G-decomposition
0 references
G- design
0 references
0.807562530040741
0 references
0.8006166219711304
0 references
0.791244626045227
0 references
0.7909369468688965
0 references
0.7857434749603271
0 references
[For the entire collection see Zbl 0625.00011.] If H and G are graphs (possibly with multiple edges and loops), then a G- decomposition of H is a decomposition of the edge set of H into subgraphs isomorphic with G. If each vertex of H occurs in precisely the same number of subgraphs in the decomposition, then the G-decomposition is said to be balanced. A G-decomposition of a graph H on v vertices is called cyclic if it is invariant under an automorphism of H consisting of a single cycle of length v. Obviously, every cyclic G-decomposition is balanced. A G-decomposition of \(\lambda K_ v\) is called a G-design. The authors prove product theorems for cyclic G-decompositions and, in particular, for cyclic G-designs.
0 references