N. M. Surbakti, Dinda Kartika, Hamidah Nasution, Sri Dewi
{"title":"比萨图的定位色度数","authors":"N. M. Surbakti, Dinda Kartika, Hamidah Nasution, Sri Dewi","doi":"10.31851/sainmatika.v20i2.13085","DOIUrl":null,"url":null,"abstract":"The location chromatic number for a graph is an extension of the concepts of partition dimension and vertex coloring in a graph. The minimum number of colors required to perform location coloring in graph G is referred to as the location chromatic number of graph G. This research is a literature study that discusses the location chromatic number of the Pizza graph. The approach used to calculate the location-chromatic number of these graphs involves determining upper and lower bounds. The results obtained show that the location chromatic number of the pizza graph is 4 for n = 3 and n for ≥ 4.","PeriodicalId":502832,"journal":{"name":"Sainmatika: Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam","volume":"10 8","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Locating Chromatic Number for Pizza Graphs\",\"authors\":\"N. M. Surbakti, Dinda Kartika, Hamidah Nasution, Sri Dewi\",\"doi\":\"10.31851/sainmatika.v20i2.13085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The location chromatic number for a graph is an extension of the concepts of partition dimension and vertex coloring in a graph. The minimum number of colors required to perform location coloring in graph G is referred to as the location chromatic number of graph G. This research is a literature study that discusses the location chromatic number of the Pizza graph. The approach used to calculate the location-chromatic number of these graphs involves determining upper and lower bounds. The results obtained show that the location chromatic number of the pizza graph is 4 for n = 3 and n for ≥ 4.\",\"PeriodicalId\":502832,\"journal\":{\"name\":\"Sainmatika: Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam\",\"volume\":\"10 8\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sainmatika: Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31851/sainmatika.v20i2.13085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sainmatika: Jurnal Ilmiah Matematika dan Ilmu Pengetahuan Alam","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31851/sainmatika.v20i2.13085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
图的位置色度数是图中分割维度和顶点着色概念的扩展。在图 G 中进行位置着色所需的最少颜色数称为图 G 的位置色度数。本研究是一项文献研究，讨论必胜图的位置色度数。计算这些图的位置色度数的方法包括确定上界和下界。得到的结果表明，当 n = 3 时，比萨图的位置色度数为 4，当 n≥ 4 时，比萨图的位置色度数为 n。
The location chromatic number for a graph is an extension of the concepts of partition dimension and vertex coloring in a graph. The minimum number of colors required to perform location coloring in graph G is referred to as the location chromatic number of graph G. This research is a literature study that discusses the location chromatic number of the Pizza graph. The approach used to calculate the location-chromatic number of these graphs involves determining upper and lower bounds. The results obtained show that the location chromatic number of the pizza graph is 4 for n = 3 and n for ≥ 4.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
