{"title":"N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs","authors":"R. Anitha, R. Lekshmi","doi":"10.5281/ZENODO.1058670","DOIUrl":null,"url":null,"abstract":"Graph decompositions are vital in the study of\ncombinatorial design theory. A decomposition of a graph G is a\npartition of its edge set. An n-sun graph is a cycle Cn with an edge\nterminating in a vertex of degree one attached to each vertex. In this\npaper, we define n-sun decomposition of some even order graphs\nwith a perfect matching. We have proved that the complete graph\nK2n, complete bipartite graph K2n, 2n and the Harary graph H4, 2n have\nn-sun decompositions. A labeling scheme is used to construct the n-suns.","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"59 1","pages":"452-457"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.1058670","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29
Abstract
Graph decompositions are vital in the study of
combinatorial design theory. A decomposition of a graph G is a
partition of its edge set. An n-sun graph is a cycle Cn with an edge
terminating in a vertex of degree one attached to each vertex. In this
paper, we define n-sun decomposition of some even order graphs
with a perfect matching. We have proved that the complete graph
K2n, complete bipartite graph K2n, 2n and the Harary graph H4, 2n have
n-sun decompositions. A labeling scheme is used to construct the n-suns.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
