P$-Polynomial Weakly Distance-Regular Digraphs

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.

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 30; no. 3
Main Authors Zeng, Qing, Yang, Yuefeng, Wang, Kaishun
Format Journal Article
LanguageEnglish
Published 14.07.2023
Online AccessGet full text

Cover

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.
AbstractList 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.
Author Wang, Kaishun
Zeng, Qing
Yang, Yuefeng
Author_xml – sequence: 1
  givenname: Qing
  surname: Zeng
  fullname: Zeng, Qing
– sequence: 2
  givenname: Yuefeng
  surname: Yang
  fullname: Yang, Yuefeng
– sequence: 3
  givenname: Kaishun
  surname: Wang
  fullname: Wang, Kaishun
BookMark eNpdj0tLAzEUhYNUsK36G7oQV6bmMXktpdYHFCyiuByut5kaTSclGRfz7y3VhXR1DoePA9-IDNrUekLOOZtKI6S-5tw4e0SGnBlDrRN68K-fkFEpn4xx4Zwakunygi5T7Nu0CRAnbx6-Yj-5DaWDFj199uvvCHk3rDNsP8opOW4gFn_2l2Pyejd_mT3QxdP94-xmQVEo1VGU2ipEbpQQiFZC02ihKiWc914qYarKrcCg8ygqA8xJCxrAmQZW70orOSZXv7-YUynZNzWGDrqQ2i5DiDVn9d613rvu8MsDfJvDBnJ_CP4AJaJTLQ
CitedBy_id crossref_primary_10_1007_s10801_024_01312_3
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.37236/11798
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1077-8926
ExternalDocumentID 10_37236_11798
GroupedDBID -~9
29G
2WC
5GY
5VS
AAFWJ
AAYXX
ACGFO
ACIPV
ADBBV
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
E3Z
EBS
EJD
FRP
GROUPED_DOAJ
H13
KWQ
M~E
OK1
OVT
P2P
REM
RNS
TR2
XSB
ID FETCH-LOGICAL-c255t-c3685cc17522cc83aff6254529eee3527449da7c9ec247a0938a6aa97fadb5653
ISSN 1077-8926
IngestDate Thu Apr 24 23:05:13 EDT 2025
Tue Jul 01 04:24:58 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c255t-c3685cc17522cc83aff6254529eee3527449da7c9ec247a0938a6aa97fadb5653
OpenAccessLink https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i3p3/pdf
ParticipantIDs crossref_citationtrail_10_37236_11798
crossref_primary_10_37236_11798
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2023-07-14
PublicationDateYYYYMMDD 2023-07-14
PublicationDate_xml – month: 07
  year: 2023
  text: 2023-07-14
  day: 14
PublicationDecade 2020
PublicationTitle The Electronic journal of combinatorics
PublicationYear 2023
SSID ssj0012995
Score 2.3852987
Snippet A weakly distance-regular digraph is $P$-polynomial if its attached scheme is $P$-polynomial. In this paper, we characterize all $P$-polynomial weakly...
SourceID crossref
SourceType Enrichment Source
Index Database
Title P$-Polynomial Weakly Distance-Regular Digraphs
Volume 30
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEN4oXvRgfEZ8YA9wXIVtaXePxmCIBoMGInoh22WbGAkYKAc8-Nud2S5tJSQ-Lk0z2W3afs08O98QUq5qVgtdoahmdUW9UIRUcq6pArCl4CCV2CjcuvebXe-2V-9lU9dMd0kcXqiPlX0l_0EVZIArdsn-Adn0oiCAc8AXjoAwHH-FcbvCPNoeD-fYW4yZby3fhnNk1IwRTPpoBs1PsIqEvNTTvCeK30cjm4GTY5CAO4VwWRr2kNTjftGJUnhYmDrUFDbX_DzTkc7ET1Z8h5OdZ6N8XoG5mLBM-jmtKqwGYL8Es0TVK2RWf9q6ymsWXi-rZTdgZnAM0s_xzPAsiu1L9ij9SxDiE7Ozb_atkw0GoQDqstZnI60UgTmtJ_-VJneWzI8y-y7NvpzDkfMcOjtk27r8zlWC3y5Z06M9stVK-XKn--SiXc7h6CQ4Oss4OgscD0j3ptG5blI7yYIqCNliqpDmXylw1RhTirsyiiDuxJq31hpc4MDzxEAGSmjFvEBWhculL6UIIjkIweV2D0lhNB7pI-JgXdrnA9eXde1FNS-s8oirGvMj4fqR7xdJZfG4fWVp3nHayLD__XUWyXm67j0hNllacfzjihOymX05p6QQT2b6DHy0OCyZ3EbJQPUF6ak73g
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=P%24-Polynomial+Weakly+Distance-Regular+Digraphs&rft.jtitle=The+Electronic+journal+of+combinatorics&rft.au=Zeng%2C+Qing&rft.au=Yang%2C+Yuefeng&rft.au=Wang%2C+Kaishun&rft.date=2023-07-14&rft.issn=1077-8926&rft.eissn=1077-8926&rft.volume=30&rft.issue=3&rft_id=info:doi/10.37236%2F11798&rft.externalDBID=n%2Fa&rft.externalDocID=10_37236_11798
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1077-8926&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1077-8926&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1077-8926&client=summon