Contents

Decompositions of \(\lambda K_{n}\) using Stanton-type Graphs

Derek W. Hein1, Dinesh G. Sarvate2
1SouTHERN UTAH University, DEPT. OF MATH., CEDAR CiTy, UT, 84720
2COLLEGE OF CHARLESTON, DEPT. OF MATH., CHARLESTON, SC, 29424

Abstract

A Stanton-type graph \( S(n, m) \) is a connected multigraph on \( n \) vertices such that for a fixed \( m \) with \( n-1 \leq m \leq \frac{n}{2} \), there is exactly one edge of multiplicity \( i \) (and no others) for each \( i = 1, 2, \ldots, m \). In this note, we show how to decompose \( \lambda K_n \) (for the appropriate minimal values of \( \lambda \)) into Stanton-type graphs \( S(4, 3) \) of the LOE and OLE types.

Keywords: Graph decompositions, multigraph decompositions, Stan- ton graphs, Stanton-type graphs.