{"title":"关于循环图的度量维数","authors":"Rui Gao, Yingqing Xiao, Zhanqi Zhang","doi":"10.4153/s0008439523000759","DOIUrl":null,"url":null,"abstract":"Abstract In this note, we bound the metric dimension of the circulant graphs $C_n(1,2,\\ldots ,t)$ . We shall prove that if $n=2tk+t$ and if t is odd, then $\\dim (C_n(1,2,\\ldots ,t))=t+1$ , which confirms Conjecture 4.1.1 in Chau and Gosselin (2017, Opuscula Mathematica 37, 509–534). In Vetrík (2017, Canadian Mathematical Bulletin 60, 206–216; 2020, Discussiones Mathematicae. Graph Theory 40, 67–76), the author has shown that $\\dim (C_n(1,2,\\ldots ,t))\\leq t+\\left \\lceil \\frac {p}{2}\\right \\rceil $ for $n=2tk+t+p$ , where $t\\geq 4$ is even, $1\\leq p\\leq t+1$ , and $k\\geq 1$ . Inspired by his work, we show that $\\dim (C_n(1,2,\\ldots ,t))\\leq t+\\left \\lfloor \\frac {p}{2}\\right \\rfloor $ for $n=2tk+t+p$ , where $t\\geq 5$ is odd, $2\\leq p\\leq t+1$ , and $k\\geq 2$ .","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Metric Dimension of Circulant Graphs\",\"authors\":\"Rui Gao, Yingqing Xiao, Zhanqi Zhang\",\"doi\":\"10.4153/s0008439523000759\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this note, we bound the metric dimension of the circulant graphs $C_n(1,2,\\\\ldots ,t)$ . We shall prove that if $n=2tk+t$ and if t is odd, then $\\\\dim (C_n(1,2,\\\\ldots ,t))=t+1$ , which confirms Conjecture 4.1.1 in Chau and Gosselin (2017, Opuscula Mathematica 37, 509–534). In Vetrík (2017, Canadian Mathematical Bulletin 60, 206–216; 2020, Discussiones Mathematicae. Graph Theory 40, 67–76), the author has shown that $\\\\dim (C_n(1,2,\\\\ldots ,t))\\\\leq t+\\\\left \\\\lceil \\\\frac {p}{2}\\\\right \\\\rceil $ for $n=2tk+t+p$ , where $t\\\\geq 4$ is even, $1\\\\leq p\\\\leq t+1$ , and $k\\\\geq 1$ . Inspired by his work, we show that $\\\\dim (C_n(1,2,\\\\ldots ,t))\\\\leq t+\\\\left \\\\lfloor \\\\frac {p}{2}\\\\right \\\\rfloor $ for $n=2tk+t+p$ , where $t\\\\geq 5$ is odd, $2\\\\leq p\\\\leq t+1$ , and $k\\\\geq 2$ .\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4153/s0008439523000759\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4153/s0008439523000759","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract In this note, we bound the metric dimension of the circulant graphs $C_n(1,2,\ldots ,t)$ . We shall prove that if $n=2tk+t$ and if t is odd, then $\dim (C_n(1,2,\ldots ,t))=t+1$ , which confirms Conjecture 4.1.1 in Chau and Gosselin (2017, Opuscula Mathematica 37, 509–534). In Vetrík (2017, Canadian Mathematical Bulletin 60, 206–216; 2020, Discussiones Mathematicae. Graph Theory 40, 67–76), the author has shown that $\dim (C_n(1,2,\ldots ,t))\leq t+\left \lceil \frac {p}{2}\right \rceil $ for $n=2tk+t+p$ , where $t\geq 4$ is even, $1\leq p\leq t+1$ , and $k\geq 1$ . Inspired by his work, we show that $\dim (C_n(1,2,\ldots ,t))\leq t+\left \lfloor \frac {p}{2}\right \rfloor $ for $n=2tk+t+p$ , where $t\geq 5$ is odd, $2\leq p\leq t+1$ , and $k\geq 2$ .