On the number of arcs in primitive digraphs with large exponents

DOI10.1016/S0024-3795(02)00568-2zbMATH Open1017.05045MaRDI QIDQ1870076FDOQ1870076

Authors: J. Shen, Cynthia J. Wyels 

Publication date: 4 May 2003

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

Recommendations

• Primitive digraphs with smallest large exponent
• Local exponents of primitive digraphs
• On the exponent of a primitive digraph
• Digraphs with large exponent
• Generalized exponents of primitive directed graphs

zbMATH Keywords

walk

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• On Lewin and Vitek's conjecture about the exponent set of primitive matrices
• The Theory of Round Robin Tournaments
• On a Problem of Partitions
• Gaps in the exponent set of primitive matrices
• On a conjecture about the exponent set of primitive matrices
• A system of gaps in the exponent set of primitive matrices
• Digraphs with large exponent

Cited In (8)

• Nonnegative primitive matrices with exponent 2
• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
• The exponent of Cartesian product of cycles
• The vertex exponent of primitive digraph of order \(n\) with girth \(r\)
• Primitive graphs with given exponents and minimum number of edges
• Primitive digraphs with smallest large exponent
• Title not available (Why is that?)
• \(k\)-primitivity of digraphs

This page was built for publication: On the number of arcs in primitive digraphs with large exponents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870076)