Packings and Coverings of Various Complete Graphs with the 4-Cycle with a Pendant Edge-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Packings and Coverings of Various Complete Graphs with the 4-Cycle with a Pendant Edge

Published:2013-09-26 Issue: Volume:2013 Page:1-8
ISSN:2090-8911
Container-title:ISRN Combinatorics
language:en
Short-container-title:ISRN Combinatorics

Author:

Coker Brandon¹,Coker Gary D.²,Gardner Robert³^ORCID,Xia Yan³

Affiliation:

1. Department of Computer Science, Francis Marion University, Florence, SC 29502, USA

2. Institute of Mathematics and Physics, Aberystwyth University, Aberystwyth, Ceredigion SY23 3BZ, UK

3. Department of Mathematics and Statistics, East Tennessee State University, Johnson City, TN 37614, USA

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 , (2) complete bipartite graphs , and (3) complete graphs with a hole . In the last two cases, we address both restricted and unrestricted coverings.

Publisher

Hindawi Limited

Subject

General Medicine

Link

http://downloads.hindawi.com/archive/2013/236298.pdf

Reference17 articles.

1. Packing and Covering of the Complete Graph with 4-Cycles*

2. Optimal packings of K4's into a Kn

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP