{"title":"路径中全显性着色的研究","authors":"A. Vijayalekshmi","doi":"10.9734/bpi/ctmcs/v9/3822f","DOIUrl":null,"url":null,"abstract":"In this paper we determine total dominator chromatic number in paths. Let be a graph without isolated vertices. A total dominator coloring of a graph G is a valid colouring of the graph G with the additional feature that each vertex in the graph G dominates a color class properly. The total dominator chromatic number of G is the fewest number of colors for which there is a total dominator coloring of G, and it is indicated by . The total dominator chromatic number in paths is determined in this research. n denotes an integer greater than or equal to 2 unless otherwise specified.","PeriodicalId":420784,"journal":{"name":"Current Topics on Mathematics and Computer Science Vol. 9","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study on Total Dominator Colorings in Paths\",\"authors\":\"A. Vijayalekshmi\",\"doi\":\"10.9734/bpi/ctmcs/v9/3822f\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we determine total dominator chromatic number in paths. Let be a graph without isolated vertices. A total dominator coloring of a graph G is a valid colouring of the graph G with the additional feature that each vertex in the graph G dominates a color class properly. The total dominator chromatic number of G is the fewest number of colors for which there is a total dominator coloring of G, and it is indicated by . The total dominator chromatic number in paths is determined in this research. n denotes an integer greater than or equal to 2 unless otherwise specified.\",\"PeriodicalId\":420784,\"journal\":{\"name\":\"Current Topics on Mathematics and Computer Science Vol. 9\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Current Topics on Mathematics and Computer Science Vol. 9\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9734/bpi/ctmcs/v9/3822f\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Current Topics on Mathematics and Computer Science Vol. 9","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/bpi/ctmcs/v9/3822f","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we determine total dominator chromatic number in paths. Let be a graph without isolated vertices. A total dominator coloring of a graph G is a valid colouring of the graph G with the additional feature that each vertex in the graph G dominates a color class properly. The total dominator chromatic number of G is the fewest number of colors for which there is a total dominator coloring of G, and it is indicated by . The total dominator chromatic number in paths is determined in this research. n denotes an integer greater than or equal to 2 unless otherwise specified.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
