{"title":"线分割图形位置色度的数量","authors":"Siti Rahmatalia, Asmiati Asmiati, Notiragayu Notiragayu","doi":"10.24198/jmi.v18.n1.36091.73-80","DOIUrl":null,"url":null,"abstract":"The locating chromatic number of a graph extends the partition dimension and vertex coloring of a graph. The minimum number of locating coloring of graph G is called the locating chromatic number of graph G . This paper will discuss the locating chromatic number of path split graph and barbell path split graph. The method used to obtain the locating chromatic number of the graph is to determine the upper and lower bound. The results obtained are that the path split graph’s locating chromatic number and the barbell are the same, namely 4.","PeriodicalId":53096,"journal":{"name":"Jurnal Matematika Integratif","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Bilangan Kromatik Lokasi Graf Split Lintasan\",\"authors\":\"Siti Rahmatalia, Asmiati Asmiati, Notiragayu Notiragayu\",\"doi\":\"10.24198/jmi.v18.n1.36091.73-80\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The locating chromatic number of a graph extends the partition dimension and vertex coloring of a graph. The minimum number of locating coloring of graph G is called the locating chromatic number of graph G . This paper will discuss the locating chromatic number of path split graph and barbell path split graph. The method used to obtain the locating chromatic number of the graph is to determine the upper and lower bound. The results obtained are that the path split graph’s locating chromatic number and the barbell are the same, namely 4.\",\"PeriodicalId\":53096,\"journal\":{\"name\":\"Jurnal Matematika Integratif\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Matematika Integratif\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24198/jmi.v18.n1.36091.73-80\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Matematika Integratif","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24198/jmi.v18.n1.36091.73-80","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The locating chromatic number of a graph extends the partition dimension and vertex coloring of a graph. The minimum number of locating coloring of graph G is called the locating chromatic number of graph G . This paper will discuss the locating chromatic number of path split graph and barbell path split graph. The method used to obtain the locating chromatic number of the graph is to determine the upper and lower bound. The results obtained are that the path split graph’s locating chromatic number and the barbell are the same, namely 4.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
