Affiliation:
1. Department of Mathematics, Kalasalingam Academy of Research and Education, Krishnankoil-626126, India
Abstract
By a [Formula: see text]-decomposition of a graph [Formula: see text] we mean a decomposition of [Formula: see text] into [Formula: see text] copies of [Formula: see text] [Formula: see text] copies of [Formula: see text] and [Formula: see text] copies of [Formula: see text], where [Formula: see text] are non-negative integers. In this paper, it is proved that the necessary conditions for the existence of a [Formula: see text]-decomposition of [Formula: see text] are sufficient, where B, the bowtie, is the graph with two triangles having exactly one common vertex. Further, it is shown that the line graph of [Formula: see text] [Formula: see text] has a [Formula: see text]-decomposition except for [Formula: see text].
Funder
Kalasalingam Academy of Research and Education
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献