On the upper generalized exponents of ministrong digraphs

DOI10.1007/BF02677388MaRDI QIDQ5949536zbMATH OpenOpenAlexFDO

Authors Bo Zhou

Publication date 28 August 2002

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02677388

zbMATH Keywords

extreme digraphsgeneralized exponentsministrong digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Review text

A digraph \(G\) is primitive if there exists a positive integer \(k\) such that there is a walk of length \(k\) from \(u\) to \(v\) for each ordered pair of not necessarily distinct nodes \(u\) and \(v\). The smallest such \(k\) is called the exponent of \(G\). A strong digraph \(D\) is ministrong or minimally strong if each digraph obtained from \(D\) by the removal of an arc is not strong. The set of all \(k\)-upper primitive ministrong digraphs of order \(n\) is denoted by \(U(n,k)\). The paper gives the maximum values for the \(k\)th upper generalized exponents of digraphs in \(U(n,k)\) with \(1\leq k\leq n\) and of the non-primitive digraphs in \(U(n,k)\) with \(2\leq k\leq n\), and characterizes completely the extreme digraphs, i.e., those digraphs whose \(k\)th upper generalized exponents achieve the corresponding maximum values.

Recommendations

• Upper generalized exponents of ministrong digraphs
• scientific article; zbMATH DE number 5670632
• The generalized exponent sets of primitive, minimally strong digraphs. II.
• scientific article; zbMATH DE number 1829538
• scientific article; zbMATH DE number 123779

Cites work

• Finiteness conditions for generalized exponents of digraphs
• Generalized exponents of non-primitive graphs
• Generalized exponents of primitive directed graphs
• Matrices with maximum upper multiexponents in the class of primitive, nearly reducible matrices
• On the Exponent of a Primitive, Nearly Reducible Matrix
• The upper generalized exponent of a digraph

Cited in

(9)

• Generalized exponents of Boolean matrices
• Upper generalized exponents of ministrong digraphs
• The upper generalized exponent of a digraph
• scientific article; zbMATH DE number 1829538 (Why is no real title available?)
• scientific article; zbMATH DE number 5670632 (Why is no real title available?)
• Minimal strong digraphs
• scientific article; zbMATH DE number 1789840 (Why is no real title available?)
• scientific article; zbMATH DE number 5194473 (Why is no real title available?)
• BOUND FOR 2-EXPONENTS OF PRIMITIVE EXTREMAL MINISTRONG DIGRAPHS

This page was built for publication: On the upper generalized exponents of ministrong digraphs

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