图反魔术标签:调查

Discret. Math. Algorithms Appl. Pub Date : 2023-07-22 DOI:10.1142/s1793830923300023

Jingxiang Jin, Zhuojie Tu

{"title":"图反魔术标签:调查","authors":"Jingxiang Jin, Zhuojie Tu","doi":"10.1142/s1793830923300023","DOIUrl":null,"url":null,"abstract":"An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.","PeriodicalId":342835,"journal":{"name":"Discret. Math. Algorithms Appl.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graph antimagic labeling: A survey\",\"authors\":\"Jingxiang Jin, Zhuojie Tu\",\"doi\":\"10.1142/s1793830923300023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.\",\"PeriodicalId\":342835,\"journal\":{\"name\":\"Discret. Math. Algorithms Appl.\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Math. Algorithms Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793830923300023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Math. Algorithms Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793830923300023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

一个简单图的反魔术标记[公式:见文]是一个双射[公式:见文]，使得[公式:见文]中的任意两个顶点[公式:见文][公式:见文][公式:见文]。本文综述了反幻标记和其他由图的反幻标记引起的标记的研究结果，并提出了一些猜想和有待解决的问题。

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

查看原文本刊更多论文

Graph antimagic labeling: A survey

An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.

求助全文

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

来源期刊

Discret. Math. Algorithms Appl.

自引率

0.00%

发文量