火炬图的优美标注

Indonesian Journal of Combinatorics Pub Date : 2018-06-12 DOI:10.19184/IJC.2018.2.1.2

J. M. Manulang, K. Sugeng

{"title":"火炬图的优美标注","authors":"J. M. Manulang, K. Sugeng","doi":"10.19184/IJC.2018.2.1.2","DOIUrl":null,"url":null,"abstract":"Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}. A graph which admits a graceful labeling is called a graceful graph. In this paper, we show that torch graph On is a graceful graph.","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"36 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graceful labeling on torch graph\",\"authors\":\"J. M. Manulang, K. Sugeng\",\"doi\":\"10.19184/IJC.2018.2.1.2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}. A graph which admits a graceful labeling is called a graceful graph. In this paper, we show that torch graph On is a graceful graph.\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"36 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indonesian Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19184/IJC.2018.2.1.2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/IJC.2018.2.1.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

设G为顶点集V=V(G)，边集E=E(G)的图。单射函数f:V ->{0,1,2，…如果f诱导出一个函数f*(uv)=|f(u)-f(v)|，该函数是E(G)到集合{1,2,3，…，|E|}的双射，则称为优美标记。允许优美标记的图称为优美图。本文证明了火炬图On是一个优美图。

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

查看原文本刊更多论文

Graceful labeling on torch graph

Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f^*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}. A graph which admits a graceful labeling is called a graceful graph. In this paper, we show that torch graph O_n is a graceful graph.

求助全文

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

来源期刊

Indonesian Journal of Combinatorics

自引率

0.00%

发文量