{"title":"分割维数为3,定位色数为4的图","authors":"D. O. Haryeni, E. Baskoro","doi":"10.5220/0009876400002775","DOIUrl":null,"url":null,"abstract":": The characterization study of all graphs with partition dimension either 2, 𝑛 − 2, 𝑛 − 1 or 𝑛 has been completely done. In the case of locating-chromatic numbers, the efforts in characterizing all graphs with locating-chromatic number either 2, 3, 𝑛 − 1 or 𝑛 have reached to complete results. In this paper we present methods to obtain a family of graphs having partition dimension 3 or locating-chromatic number 4 by using the previous known results.","PeriodicalId":257157,"journal":{"name":"Proceedings of the 1st International MIPAnet Conference on Science and Mathematics","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graphs with Partition Dimension 3 and Locating-chromatic Number 4\",\"authors\":\"D. O. Haryeni, E. Baskoro\",\"doi\":\"10.5220/0009876400002775\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": The characterization study of all graphs with partition dimension either 2, 𝑛 − 2, 𝑛 − 1 or 𝑛 has been completely done. In the case of locating-chromatic numbers, the efforts in characterizing all graphs with locating-chromatic number either 2, 3, 𝑛 − 1 or 𝑛 have reached to complete results. In this paper we present methods to obtain a family of graphs having partition dimension 3 or locating-chromatic number 4 by using the previous known results.\",\"PeriodicalId\":257157,\"journal\":{\"name\":\"Proceedings of the 1st International MIPAnet Conference on Science and Mathematics\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1st International MIPAnet Conference on Science and Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0009876400002775\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1st International MIPAnet Conference on Science and Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0009876400002775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Graphs with Partition Dimension 3 and Locating-chromatic Number 4
: The characterization study of all graphs with partition dimension either 2, 𝑛 − 2, 𝑛 − 1 or 𝑛 has been completely done. In the case of locating-chromatic numbers, the efforts in characterizing all graphs with locating-chromatic number either 2, 3, 𝑛 − 1 or 𝑛 have reached to complete results. In this paper we present methods to obtain a family of graphs having partition dimension 3 or locating-chromatic number 4 by using the previous known results.