Decompositions of Various Complete Graphs into Isomorphic Copies of 4-cycles with Three Pendant Edges

被引:0
|
作者
Abueida, Atif [1 ]
Alzahrani, Rabab [1 ]
机构
[1] Department of Mathematics, University of Dayton, 300 College Park, Dayton,OH,45469-2316, United States
关键词
Graph theory;
D O I
暂无
中图分类号
学科分类号
摘要
An H-decomposition of a graph G is a partition of the edges of G into copies isomorphic to H. When the decomposition is not feasible, one looks for the best possible by minimizing; the number of unused edges (leave of a packing), or the number of reused edges (padding of a covering). We consider the H-decomposition, packing, and covering of the complete graphs and complete bipartite graphs, where H is a 4-cycle with three pendant edges. © 2019 Charles Babbage Research Centre. All rights reserved.
引用
收藏
页码:53 / 64
相关论文
共 50 条