断开网格相关图的优雅标记

Bulletin of Mathematical Sciences and Applications Pub Date : 2015-02-02 DOI:10.18052/WWW.SCIPRESS.COM/BMSA.11.6

V. J. Kaneria, H. M. Makadia, R. Viradia

{"title":"断开网格相关图的优雅标记","authors":"V. J. Kaneria, H. M. Makadia, R. Viradia","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.11.6","DOIUrl":null,"url":null,"abstract":"In this paper we have proved that union of three grid graphs, and union of finite copies of a grid graph are graceful. We have also given two graceful labeling functions to the grid graph .","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"GRACEFUL LABELING FOR DISCONNECTED GRID RELATED GRAPHS\",\"authors\":\"V. J. Kaneria, H. M. Makadia, R. Viradia\",\"doi\":\"10.18052/WWW.SCIPRESS.COM/BMSA.11.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we have proved that union of three grid graphs, and union of finite copies of a grid graph are graceful. We have also given two graceful labeling functions to the grid graph .\",\"PeriodicalId\":252632,\"journal\":{\"name\":\"Bulletin of Mathematical Sciences and Applications\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Mathematical Sciences and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.11.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Mathematical Sciences and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.11.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文证明了三个网格图的并集和一个网格图的有限副本的并集是优美的。我们还给出了网格图的两个优美标注函数。

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

查看原文本刊更多论文

GRACEFUL LABELING FOR DISCONNECTED GRID RELATED GRAPHS

In this paper we have proved that union of three grid graphs, and union of finite copies of a grid graph are graceful. We have also given two graceful labeling functions to the grid graph .

求助全文

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

来源期刊

Bulletin of Mathematical Sciences and Applications

自引率

0.00%

发文量