On the exponents of primitive, ministrong digraphs with shortest elementary circuit length \(s\)
From MaRDI portal
Publication:1894467
DOI10.1016/0024-3795(93)00274-4zbMath0824.05026OpenAlexW1996225940MaRDI QIDQ1894467
Xiao-Jun Wu, Zhiming Jiang, Xizhao Zhou, Jia-yu Shao
Publication date: 9 November 1995
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(93)00274-4
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- On the exponent of a primitive digraph
- On a conjecture about the exponent set of primitive matrices
- On the exponents of primitive digraphs with the shortest elementary circuit length s
- On the Exponent of a Primitive, Nearly Reducible Matrix
- Bounds for a Linear Diophantine Problem of Frobenius
- On the Exponent of a Primitive, Nearly Reducible Matrix. II
