Weakly distance-regular digraphs whose underlying graphs are distance-regular, I

Pub Date : 2024-04-02 DOI:10.1007/s10801-024-01312-3
Yuefeng Yang, Qing Zeng, Kaishun Wang
{"title":"Weakly distance-regular digraphs whose underlying graphs are distance-regular, I","authors":"Yuefeng Yang, Qing Zeng, Kaishun Wang","doi":"10.1007/s10801-024-01312-3","DOIUrl":null,"url":null,"abstract":"<p>Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In Wang and Suzuki (Discrete Math 264:225–236, 2003), the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph. In this paper, we initiate this project and classify all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded <i>n</i>-cubes and Doob graphs, respectively.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10801-024-01312-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In Wang and Suzuki (Discrete Math 264:225–236, 2003), the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph. In this paper, we initiate this project and classify all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes and Doob graphs, respectively.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
其底层图是距离规则的弱距离规则数图,I
弱距离规则数图是距离规则图的自然有向版本。在 Wang and Suzuki (Discrete Math 264:225-236, 2003)一文中,第三作者和铃木提出了一个问题:距离规则图的定向何时定义为弱距离规则数图?在本文中,我们启动了这一项目,并对所有底图分别是汉明图、折叠 n 立方图和 Doob 图的交换弱距离正则数图进行了分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
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