Packings and Coverings of Various Complete Graphs with the 4-Cycle with a Pendant Edge. (26th September 2013)

• Record Type: Journal Article
• Authors: Coker, Brandon; Coker, Gary D.; Gardner, Robert; Xia, Yan
• Other Names: da Fonseca C. Academic Editor.; Jorgensen P. E. Academic Editor.; Kelarev A. V. Academic Editor.; Zhou S. Academic Editor.
• Is Part Of: ISRN combinatorics. Volume 2013(2013)
• Publication Date: 2013-09-26
• Subjects: Combinatorial analysis -- Periodicals; Combinatorial analysis; Electronic journals; Periodicals; 511.6
• DOI: 10.1155/2013/236298
• Languages: English
• ISSNs: 2090-8911

Abstract

Abstract : We consider the packings and coverings of complete graphs with isomorphic copies of the 4-cycle with a pendant edge. Necessary and sufficient conditions are given for such structures for (1) complete graphs K v, (2) complete bipartite graphs K m, n, and (3) complete graphs with a hole K ( v, w ) . In the last two cases, we address both restricted and unrestricted coverings.