{"title":"多分辨图集的独立性","authors":"S. Sharma, V. K. Bhat","doi":"10.1080/23799927.2023.2182234","DOIUrl":null,"url":null,"abstract":"ABSTRACT In this work, we introduce the concept of independence in multiresolving sets and present some basic results on it. We characterize two graph families for which we prove that their multiset dimension is three. We also provide a corrected proof for the multiset dimension of the grid graph , due to Simanjuntak et al., present in the literature.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Independence in multiresolving sets of graphs\",\"authors\":\"S. Sharma, V. K. Bhat\",\"doi\":\"10.1080/23799927.2023.2182234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT In this work, we introduce the concept of independence in multiresolving sets and present some basic results on it. We characterize two graph families for which we prove that their multiset dimension is three. We also provide a corrected proof for the multiset dimension of the grid graph , due to Simanjuntak et al., present in the literature.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2023.2182234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2023.2182234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
ABSTRACT In this work, we introduce the concept of independence in multiresolving sets and present some basic results on it. We characterize two graph families for which we prove that their multiset dimension is three. We also provide a corrected proof for the multiset dimension of the grid graph , due to Simanjuntak et al., present in the literature.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
