具有自重复的4、5次几乎摩尔有向图的不存在性

IF 0.7 4区 数学 Q2 MATHEMATICS Electronic Journal of Combinatorics Pub Date : 2023-03-24 DOI:10.37236/11335
N. López, A. Messegué, J. Miret
{"title":"具有自重复的4、5次几乎摩尔有向图的不存在性","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":"{\"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}","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

摘要

一个几乎摩尔$(d,k)$ -有向图是一个有向图的度$d>1$,直径$k>1$和阶$N(d,k)=d+d^2+\cdots +d^k$。到目前为止,它们的存在只证明了$k=2$,而已知的是,$k=3$, $4$和$d=2$, $3$当$k\geq 3$时没有这样的有向图。此外,在某些假设下,还证明了其余情况的不存在性。本文证明了$k\geq 5$不存在$(4,k)$和$(5,k)$具有自重复的-almost Moore有向图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Nonexistence of Almost Moore Digraphs of Degrees 4 and 5 with Self-Repeats
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$.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.30
自引率
14.30%
发文量
212
审稿时长
3-6 weeks
期刊介绍: 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.
期刊最新文献
Three New Refined Arnold Families On Sequences Without Short Zero-Sum Subsequences Weak Degeneracy of Planar Graphs and Locally Planar Graphs Generalized Heawood Numbers The Degree and Codegree Threshold for Linear Triangle Covering in 3-Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1