{"title":"若干图的邻顶点强区分全色数","authors":"QianTai Yan, WuZhuang Li","doi":"10.1109/ITA.2013.96","DOIUrl":null,"url":null,"abstract":"In this paper, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm, n are given.","PeriodicalId":285687,"journal":{"name":"2013 International Conference on Information Technology and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the Adjacent Vertex Strong Distinguishing Total Chromatic Number of Some Graphs\",\"authors\":\"QianTai Yan, WuZhuang Li\",\"doi\":\"10.1109/ITA.2013.96\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm, n are given.\",\"PeriodicalId\":285687,\"journal\":{\"name\":\"2013 International Conference on Information Technology and Applications\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Information Technology and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2013.96\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2013.96","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Adjacent Vertex Strong Distinguishing Total Chromatic Number of Some Graphs
In this paper, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm, n are given.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
