Wielandt type theorem for Cartesian product of digraphs

DOI10.1016/J.LAA.2008.04.029zbMath1198.05082OpenAlexW1969954094MaRDI QIDQ932153

Byeong Moon Kim, Byung Chul Song, Woonjae Hwang

Publication date: 10 July 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.04.029

zbMATH Keywords

exponentdigraphsCartesian product

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Unnamed Item ⋮ The exponent of Cartesian product of cycles ⋮ Digraphs Products

Cites Work

• Primitive graphs with given exponents and minimum number of edges
• On Lewin and Vitek's conjecture about the exponent set of primitive matrices
• The exponent set of symmetric primitive (0,1) matrices with zero trace
• The characterization of symmetric primitive matrices with exponent \(n-1\).
• On exponents of primitive matrices
• Nonnegative primitive matrices with exponent 2
• Unzerlegbare, nicht negative Matrizen
• The characterization of symmetric primitive matrices with exponent 2n−2r(n)^∗
• On a Problem of Partitions
• Unnamed Item
• Unnamed Item

This page was built for publication: Wielandt type theorem for Cartesian product of digraphs