其底层图是距离规则的弱距离规则数图，I

Pub Date : 2024-04-02 DOI:10.1007/s10801-024-01312-3

Yuefeng Yang, Qing Zeng, Kaishun Wang

{"title":"其底层图是距离规则的弱距离规则数图，I","authors":"Yuefeng Yang, Qing Zeng, Kaishun Wang","doi":"10.1007/s10801-024-01312-3","DOIUrl":null,"url":null,"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.","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":"{\"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\":\"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.\",\"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}","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

摘要

弱距离规则数图是距离规则图的自然有向版本。在 Wang and Suzuki (Discrete Math 264:225-236, 2003)一文中，第三作者和铃木提出了一个问题：距离规则图的定向何时定义为弱距离规则数图？在本文中，我们启动了这一项目，并对所有底图分别是汉明图、折叠 n 立方图和 Doob 图的交换弱距离正则数图进行了分类。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助