Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges

Haghshenas, Sadegheh and Dyer, Danny and Shalaby, Nabil (2015) Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges. Graphs and Combinatorics. pp. 1-19. ISSN 1435-5914

[img] [English] PDF (The version available in this research repository is a postprint. It has the same peer-reviewed content as the published version, but lacks publisher layout and branding.) - Published Version
Available under License Creative Commons Attribution Non-commercial.

Download (351Kb)

Abstract

The packing and covering problems have been considered for several classes of graphs. For instance, Bryant et. al. have investigated the packing problem for paths and cycles, and the packing and covering problems for 3-cubes. The packing and covering problems were settled for stars with up to six edges by Roditty. In this paper, for every possible leave graph (excess graph), we find a corresponding maximum packing (minimum covering) of the complete graph with stars with up to five edges.

Item Type: Article
URI: http://research.library.mun.ca/id/eprint/11679
Item ID: 11679
Keywords: Packing, Covering, Leave graph, Excess graph
Department(s): Science, Faculty of > Mathematics and Statistics
Date: 6 October 2015
Date Type: Publication
Related URLs:

Actions (login required)

View Item View Item

Downloads

Downloads per month over the past year

View more statistics