The primitive doubly symmetric digraphs with largest scrambling index
Ars Combinatoria · 17.06.2026 · 167 · 135-145
DOI: 10.61091/ars167-09 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, online erschienen am 17.06.2026. Verfasst von Yunluan Chen und 1 weiteren Autor:innen.
Abstract (Originalsprache)
A strongly connected digraph \(D\) is primitive provided the greatest common divisor of the lengths of its directed cycles equals 1. The scrambling index of a primitive digraph \(D\) is the smallest positive integer \(k\) such that for every pair of vertices \(u\) and \(v\), there is a vertex \(w\) such that we can get to \(w\) from \(u\) and \(v\) in \(D\) by directed walks of length \(k\). In this paper, we characterize those primitive doubly symmetric digraphs with the largest scrambling index.
Zitieren
APA
Chen, Y., & Chen, S. (2026). The primitive doubly symmetric digraphs with largest scrambling index. Ars Combinatoria, 167, 135-145. https://doi.org/10.61091/ars167-09
Vancouver
Chen Y, Chen S. The primitive doubly symmetric digraphs with largest scrambling index. Ars Combinatoria. 2026;167:135-145. doi:10.61091/ars167-09
BibTeX
@article{Chen2026,
author = {Chen, Yunluan and Chen, Shexi},
title = {The primitive doubly symmetric digraphs with largest scrambling index},
journal = {Ars Combinatoria},
year = {2026},
volume = {167},
pages = {135--145},
doi = {10.61091/ars167-09}
}
EUVIMED