Decompositions of \(\lambda K_n\) using Stanton-type graphs (Q2927771)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decompositions of \(\lambda K_n\) using Stanton-type graphs |
scientific article; zbMATH DE number 6365692
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions of \(\lambda K_n\) using Stanton-type graphs |
scientific article; zbMATH DE number 6365692 |
Statements
4 November 2014
0 references
Stanton graph
0 references
complete multigraph decomposition
0 references
Decompositions of \(\lambda K_n\) using Stanton-type graphs (English)
0 references
A Stanton type graph \(S(n,m)\) is a connected multigraph with \(n\) vertices and \(m\) edges such that the edge multiplicities are \(1,2,\dots,m\), each appearing precisely once. The LOE and ELO graphs are \(S(4,3)\) paths with the central edge of multiplicity 2 and 1, respectively.NEWLINENEWLINEMinimal values of \(\lambda\) for which LEO or ELO decompositions of \(\lambda K_n\) exist are determined for all values of \(n\).
0 references
