{"title":"$P$-Polynomial Weakly Distance-Regular Digraphs","authors":"Zeng Qing, Yuefeng Yang, Kaishun Wang","doi":"10.37236/11798","DOIUrl":null,"url":null,"abstract":"A weakly distance-regular digraph is $P$-polynomial if its attached scheme is $P$-polynomial. In this paper, we characterize all $P$-polynomial weakly distance-regular digraphs.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"50 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2022-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37236/11798","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 2
Abstract
A weakly distance-regular digraph is $P$-polynomial if its attached scheme is $P$-polynomial. In this paper, we characterize all $P$-polynomial weakly distance-regular digraphs.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
