{"title":"周长为7的广义Petersen图上的系数为4","authors":"Harmony Morris, Joy Morris","doi":"10.26493/2590-9770.1382.2ad","DOIUrl":null,"url":null,"abstract":"We show that if $n=7k/i$ with $i \\in \\{1,2,3\\}$ then the cop number of the generalised Petersen graph $GP(n,k)$ is $4$, with some small previously-known exceptions. It was previously proved by Ball et al. (2015) that the cop number of any generalised Petersen graph is at most $4$. The results in this paper explain all of the known generalised Petersen graphs that actually have cop number $4$ but were not previously explained by Morris et al. in a recent preprint, and places them in the context of infinite families. (More precisely, the preprint by Morris et al. explains all known generalised Petersen graphs with cop number $4$ and girth $8$, while this paper explains those that have girth $7$.)","PeriodicalId":236892,"journal":{"name":"Art Discret. Appl. Math.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On generalised Petersen graphs of girth 7 that have cop number 4\",\"authors\":\"Harmony Morris, Joy Morris\",\"doi\":\"10.26493/2590-9770.1382.2ad\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that if $n=7k/i$ with $i \\\\in \\\\{1,2,3\\\\}$ then the cop number of the generalised Petersen graph $GP(n,k)$ is $4$, with some small previously-known exceptions. It was previously proved by Ball et al. (2015) that the cop number of any generalised Petersen graph is at most $4$. The results in this paper explain all of the known generalised Petersen graphs that actually have cop number $4$ but were not previously explained by Morris et al. in a recent preprint, and places them in the context of infinite families. (More precisely, the preprint by Morris et al. explains all known generalised Petersen graphs with cop number $4$ and girth $8$, while this paper explains those that have girth $7$.)\",\"PeriodicalId\":236892,\"journal\":{\"name\":\"Art Discret. Appl. Math.\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Art Discret. Appl. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26493/2590-9770.1382.2ad\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Art Discret. Appl. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/2590-9770.1382.2ad","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们证明,如果$n=7k/i$且$i \in \{1,2,3\}$,则广义Petersen图$GP(n,k)$的cop数为$4$,除了一些先前已知的小例外。Ball et al.(2015)先前证明了任何广义Petersen图的cop数最多为$4$。本文的结果解释了所有已知的广义Petersen图,这些图实际上具有cop数$4$,但Morris等人在最近的预印本中没有解释过,并将它们置于无限族的背景下。(更准确地说,Morris等人的预印本解释了所有已知的周长为8美元的广义Petersen图,而本文解释了周长为7美元的广义Petersen图。)
On generalised Petersen graphs of girth 7 that have cop number 4
We show that if $n=7k/i$ with $i \in \{1,2,3\}$ then the cop number of the generalised Petersen graph $GP(n,k)$ is $4$, with some small previously-known exceptions. It was previously proved by Ball et al. (2015) that the cop number of any generalised Petersen graph is at most $4$. The results in this paper explain all of the known generalised Petersen graphs that actually have cop number $4$ but were not previously explained by Morris et al. in a recent preprint, and places them in the context of infinite families. (More precisely, the preprint by Morris et al. explains all known generalised Petersen graphs with cop number $4$ and girth $8$, while this paper explains those that have girth $7$.)