A. I. Kristiana, Alvian Bagus Agatha, Saddam Hussen, Rafiantika Megahnia Prihandini, Dian Kurniati, R. Alfarisi
{"title":"网格图族中的包容性局部不规则顶点着色","authors":"A. I. Kristiana, Alvian Bagus Agatha, Saddam Hussen, Rafiantika Megahnia Prihandini, Dian Kurniati, R. Alfarisi","doi":"10.18860/ca.v9i1.20947","DOIUrl":null,"url":null,"abstract":"Let is a simple graph and connected where is vertex set and is edge set. A maping as vertex k- labeling and function : is inclusive local irregularity vertex coloring, with . The minimum number of colors produced from inclusive local irregularity vertex coloring of graph is called inclusive chromatic number local irregularity, denoted by . On this paper, we learn about the inclusive local irregularity vertex coloring and determine the chromatic number on grid graph family.","PeriodicalId":388519,"journal":{"name":"CAUCHY: Jurnal Matematika Murni dan Aplikasi","volume":"3 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Inclusive Local Irregularity Vertex Coloring In Grid Graph Family\",\"authors\":\"A. I. Kristiana, Alvian Bagus Agatha, Saddam Hussen, Rafiantika Megahnia Prihandini, Dian Kurniati, R. Alfarisi\",\"doi\":\"10.18860/ca.v9i1.20947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let is a simple graph and connected where is vertex set and is edge set. A maping as vertex k- labeling and function : is inclusive local irregularity vertex coloring, with . The minimum number of colors produced from inclusive local irregularity vertex coloring of graph is called inclusive chromatic number local irregularity, denoted by . On this paper, we learn about the inclusive local irregularity vertex coloring and determine the chromatic number on grid graph family.\",\"PeriodicalId\":388519,\"journal\":{\"name\":\"CAUCHY: Jurnal Matematika Murni dan Aplikasi\",\"volume\":\"3 11\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CAUCHY: Jurnal Matematika Murni dan Aplikasi\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18860/ca.v9i1.20947\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CAUCHY: Jurnal Matematika Murni dan Aplikasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18860/ca.v9i1.20947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Inclusive Local Irregularity Vertex Coloring In Grid Graph Family
Let is a simple graph and connected where is vertex set and is edge set. A maping as vertex k- labeling and function : is inclusive local irregularity vertex coloring, with . The minimum number of colors produced from inclusive local irregularity vertex coloring of graph is called inclusive chromatic number local irregularity, denoted by . On this paper, we learn about the inclusive local irregularity vertex coloring and determine the chromatic number on grid graph family.