{"title":"Nonexistence of Almost Moore Digraphs of Degrees 4 and 5 with Self-Repeats","authors":"N. López, A. Messegué, J. Miret","doi":"10.37236/11335","DOIUrl":null,"url":null,"abstract":"An almost Moore $(d,k)$-digraph is a regular digraph of degree $d>1$, diameter $k>1$ and order $N(d,k)=d+d^2+\\cdots +d^k$. So far, their existence has only been shown for $k=2$, whilst it is known that there are no such digraphs for $k=3$, $4$ and for $d=2$, $3$ when $k\\geq 3$. Furthermore, under certain assumptions, the nonexistence for the remaining cases has also been shown. In this paper, we prove that $(4,k)$ and $(5,k)$-almost Moore digraphs with self-repeats do not exist for $k\\geq 5$.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"18 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37236/11335","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
An almost Moore $(d,k)$-digraph is a regular digraph of degree $d>1$, diameter $k>1$ and order $N(d,k)=d+d^2+\cdots +d^k$. So far, their existence has only been shown for $k=2$, whilst it is known that there are no such digraphs for $k=3$, $4$ and for $d=2$, $3$ when $k\geq 3$. Furthermore, under certain assumptions, the nonexistence for the remaining cases has also been shown. In this paper, we prove that $(4,k)$ and $(5,k)$-almost Moore digraphs with self-repeats do not exist for $k\geq 5$.
期刊介绍:
The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.