{"title":"关于循环图的支配子着色","authors":"A. S. Devi, M. Shanmugapriya","doi":"10.36039/AA082015002","DOIUrl":null,"url":null,"abstract":"The concept of dominator chromatic number was introduced by Gera et al. [4]. A dominator coloring of G is a proper coloring in which every vertex of G dominates every vertex of at least one color class. The dominator chromatic number, is the minimum number of colors, which a dominator coloring of G requires.In this paper we found the dominator coloring of Circulant graph.","PeriodicalId":360729,"journal":{"name":"Automation and Autonomous System","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On Dominator Coloring in Circulant Graphs\",\"authors\":\"A. S. Devi, M. Shanmugapriya\",\"doi\":\"10.36039/AA082015002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The concept of dominator chromatic number was introduced by Gera et al. [4]. A dominator coloring of G is a proper coloring in which every vertex of G dominates every vertex of at least one color class. The dominator chromatic number, is the minimum number of colors, which a dominator coloring of G requires.In this paper we found the dominator coloring of Circulant graph.\",\"PeriodicalId\":360729,\"journal\":{\"name\":\"Automation and Autonomous System\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Automation and Autonomous System\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.36039/AA082015002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automation and Autonomous System","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36039/AA082015002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The concept of dominator chromatic number was introduced by Gera et al. [4]. A dominator coloring of G is a proper coloring in which every vertex of G dominates every vertex of at least one color class. The dominator chromatic number, is the minimum number of colors, which a dominator coloring of G requires.In this paper we found the dominator coloring of Circulant graph.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
