完全图、完全二部图和一些哈拉图的N-Sun分解

World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering Pub Date : 2008-07-23 DOI:10.5281/ZENODO.1058670

R. Anitha, R. Lekshmi

{"title":"完全图、完全二部图和一些哈拉图的N-Sun分解","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":"{\"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}","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

摘要

图的分解在组合设计理论的研究中是至关重要的。图G的分解是对其边集的分割。n-太阳图是一个循环Cn，它的边终止于与每个顶点相连的一次顶点。在本文中，我们定义了具有完美匹配的偶阶图的n-太阳分解。我们证明了完全图K2n，完全二部图K2n, 2n和哈拉图H4, 2n有太阳分解。使用标记方案来构造n-太阳。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering

自引率

0.00%

发文量