Contents

-

Decomposition of a 2K10t into H3 Graphs

Dinesh G.Sarvate1, Li Zhang 2
1Department of Mathematics College of Charleston Charleston, SC 29424
2Department of Mathematics and Computer Science The Citadel Charleston, SC 29409

Abstract

An H3 graph is a multigraph on three vertices with double edges between two pairs of distinct vertices and a single edge between the third pair. In this paper, we decompose a complete multigraph 2K10t into H3 graphs.