Primitive graphs with given exponents and minimum number of edges

DOI10.1016/J.LAA.2006.08.021zbMath1106.05062OpenAlexW1992085052MaRDI QIDQ861030

Byung Chul Song, Woonjae Hwang, Byeong Moon Kim

Publication date: 9 January 2007

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

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs ⋮ Wielandt type theorem for Cartesian product of digraphs ⋮ The exponent of Cartesian product of cycles ⋮ Exponent-critical primitive graphs and the Kronecker product

Cites Work

• On a conjecture about the exponent set of primitive matrices
• 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 the number of arcs in primitive digraphs with large exponents
• On exponents of primitive matrices
• Nonnegative primitive matrices with exponent 2
• Unzerlegbare, nicht negative Matrizen
• On Powers of Non-Negative Matrices
• The characterization of symmetric primitive matrices with exponent 2n−2r(n)^∗
• Unnamed Item
• Unnamed Item

This page was built for publication: Primitive graphs with given exponents and minimum number of edges