{"title":"图的若干解集","authors":"B. Sooryanarayana, Suma A.S., Chandrakala S.B.","doi":"10.22342/JIMS.27.1.881.103-114","DOIUrl":null,"url":null,"abstract":"Let G=(V,E) be a simple connected graph. For each ordered subset S={s_1,s_2,...,s_k} of V and a vertex u in V, we associate a vector Gamma(u/S)=(d(u,s_1),d(u,s_2),...,d(u,s_k)) with respect to S, where d(u,v) denote the distance between u and v in G. A subset S is said to be resolving set of G if Gamma(u/S) not equal to Gamma(v/S) for all u, v in V-S. The purpose of this paper is to introduce various types of r-sets and compute minimum cardinality of each set, in possible cases, particulary for paths, cycles, complete graphs and wheels.","PeriodicalId":42206,"journal":{"name":"Journal of the Indonesian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2021-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Certain Varieties of Resolving Sets of A Graph\",\"authors\":\"B. Sooryanarayana, Suma A.S., Chandrakala S.B.\",\"doi\":\"10.22342/JIMS.27.1.881.103-114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G=(V,E) be a simple connected graph. For each ordered subset S={s_1,s_2,...,s_k} of V and a vertex u in V, we associate a vector Gamma(u/S)=(d(u,s_1),d(u,s_2),...,d(u,s_k)) with respect to S, where d(u,v) denote the distance between u and v in G. A subset S is said to be resolving set of G if Gamma(u/S) not equal to Gamma(v/S) for all u, v in V-S. The purpose of this paper is to introduce various types of r-sets and compute minimum cardinality of each set, in possible cases, particulary for paths, cycles, complete graphs and wheels.\",\"PeriodicalId\":42206,\"journal\":{\"name\":\"Journal of the Indonesian Mathematical Society\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2021-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Indonesian Mathematical Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22342/JIMS.27.1.881.103-114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Indonesian Mathematical Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22342/JIMS.27.1.881.103-114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Let G=(V,E) be a simple connected graph. For each ordered subset S={s_1,s_2,...,s_k} of V and a vertex u in V, we associate a vector Gamma(u/S)=(d(u,s_1),d(u,s_2),...,d(u,s_k)) with respect to S, where d(u,v) denote the distance between u and v in G. A subset S is said to be resolving set of G if Gamma(u/S) not equal to Gamma(v/S) for all u, v in V-S. The purpose of this paper is to introduce various types of r-sets and compute minimum cardinality of each set, in possible cases, particulary for paths, cycles, complete graphs and wheels.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
