{"title":"关于杠铃阴影路径图色数的定位","authors":"A. Asmiati, Maharani Damayanti, L. Yulianti","doi":"10.19184/ijc.2021.5.2.4","DOIUrl":null,"url":null,"abstract":"The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph is defined as the cardinality of the minimum color classes of the graph. In this paper, we discuss about the locating-chromatic number of shadow path graph and barbell graph containing shadow graph.","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"116 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the Locating Chromatic Number of Barbell Shadow Path Graph\",\"authors\":\"A. Asmiati, Maharani Damayanti, L. Yulianti\",\"doi\":\"10.19184/ijc.2021.5.2.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph is defined as the cardinality of the minimum color classes of the graph. In this paper, we discuss about the locating-chromatic number of shadow path graph and barbell graph containing shadow graph.\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"116 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indonesian Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19184/ijc.2021.5.2.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/ijc.2021.5.2.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Locating Chromatic Number of Barbell Shadow Path Graph
The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph is defined as the cardinality of the minimum color classes of the graph. In this paper, we discuss about the locating-chromatic number of shadow path graph and barbell graph containing shadow graph.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
