Contents

Ars Combinatoria

  • Research article

Decomposition of a \(2K_{10t}\) into \(H_3\) 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
  • Published: 31/07/2015

Abstract

An \(H_3\) 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 \(2K_{10t}\) into \(H_3\) graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Dinesh G.Sarvate, Li Zhang . Decomposition of a \(2K_{10t}\) into \(H_3\) Graphs[J], Ars Combinatoria, Volume 121. 315-319. .