Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Spectrum Problem for A-Fold Petersen Graph Designs

Peter Adams1, Darryn E. Bryant1, A. Khodkar1
1Centre for Combinatorics Department of Mathematics The University of Queensland Queensland 4072 Australia
  • Published: 31/08/2000

Abstract

Necessary and sufficient conditions for the existence of a decomposition of \(\lambda K_v\) into edge-disjoint copies of the Petersen graph are proved.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Peter Adams, Darryn E. Bryant, A. Khodkar. The Spectrum Problem for A-Fold Petersen Graph Designs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 034. 159-176. DOI: .