Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Constructing the Spectrum of Packings and Coverings for the Complete Graph with 4-stars

Danny Dyer1, Sadegheh Haghshenas1, Nabil Shalaby1
1Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John’s, Newfoundland, Canada, AIC 5S7
  • Published: 29/02/2016

Abstract

The packing and covering numbers for the 4-stars were determined by Roditty in 1986. In this paper, we improve and extend these results by finding a corresponding maximum packing and minimum covering of the complete graph with 4-stars for every possible leave graph and excess graph.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby. Constructing the Spectrum of Packings and Coverings for the Complete Graph with 4-stars[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 096. 321-334. DOI: .