{"title":"与循环相关的分裂图和阴影图的反幻图标记改进方案","authors":"Zareen Tasneem, Farissa Tafannum, M. Rahman","doi":"10.1109/ICASERT.2019.8934741","DOIUrl":null,"url":null,"abstract":"Antimagic graph labeling is the allotment of positive numbers to the edges of a graph such that the sum of graph edge labels incident to each node varies. The paper emphasizes on strong antimagic graph labeling for splitting graph and shadow graph of cycle. Modified theorems and their proofs on splitting and shadow graphs of cycle have been presented. The validity of the theorems has been illustrated through numerous examples.","PeriodicalId":6613,"journal":{"name":"2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)","volume":"64 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Revised Scheme for Antimagic Graph Labeling for Splitting Graph and Shadow Graph Associated with Cycle\",\"authors\":\"Zareen Tasneem, Farissa Tafannum, M. Rahman\",\"doi\":\"10.1109/ICASERT.2019.8934741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Antimagic graph labeling is the allotment of positive numbers to the edges of a graph such that the sum of graph edge labels incident to each node varies. The paper emphasizes on strong antimagic graph labeling for splitting graph and shadow graph of cycle. Modified theorems and their proofs on splitting and shadow graphs of cycle have been presented. The validity of the theorems has been illustrated through numerous examples.\",\"PeriodicalId\":6613,\"journal\":{\"name\":\"2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)\",\"volume\":\"64 1\",\"pages\":\"1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASERT.2019.8934741\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASERT.2019.8934741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Revised Scheme for Antimagic Graph Labeling for Splitting Graph and Shadow Graph Associated with Cycle
Antimagic graph labeling is the allotment of positive numbers to the edges of a graph such that the sum of graph edge labels incident to each node varies. The paper emphasizes on strong antimagic graph labeling for splitting graph and shadow graph of cycle. Modified theorems and their proofs on splitting and shadow graphs of cycle have been presented. The validity of the theorems has been illustrated through numerous examples.