{"title":"用子图嵌入法标记一类三次图","authors":"Yujie Bai","doi":"10.5815/IJMSC.2021.01.01","DOIUrl":null,"url":null,"abstract":"Based on a problem raised by Gao et. al. (Bull. Malays. Math. Sci. Soc., 41 (2018) 443–453.), we construct a family of cubic graphs which are double-edge blow-up of ladder graphs. We determine the full friendly index sets of these cubic graphs by embedding labeling graph method. At the same time, the corresponding labeling graphs are provided.","PeriodicalId":312036,"journal":{"name":"International Journal of Mathematical Sciences and Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Labeling a kind of Cubic Graphs by Subgraph Embedding Method\",\"authors\":\"Yujie Bai\",\"doi\":\"10.5815/IJMSC.2021.01.01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on a problem raised by Gao et. al. (Bull. Malays. Math. Sci. Soc., 41 (2018) 443–453.), we construct a family of cubic graphs which are double-edge blow-up of ladder graphs. We determine the full friendly index sets of these cubic graphs by embedding labeling graph method. At the same time, the corresponding labeling graphs are provided.\",\"PeriodicalId\":312036,\"journal\":{\"name\":\"International Journal of Mathematical Sciences and Computing\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-02-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Mathematical Sciences and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5815/IJMSC.2021.01.01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mathematical Sciences and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5815/IJMSC.2021.01.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Labeling a kind of Cubic Graphs by Subgraph Embedding Method
Based on a problem raised by Gao et. al. (Bull. Malays. Math. Sci. Soc., 41 (2018) 443–453.), we construct a family of cubic graphs which are double-edge blow-up of ladder graphs. We determine the full friendly index sets of these cubic graphs by embedding labeling graph method. At the same time, the corresponding labeling graphs are provided.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
