Abstract. Let e(Tn) be the primitive exponent of a primitive tournament Tn of order n. In this paper, we obtain the following results.

Extreme tournaments with given primitive exponents · Shangwang Tan, Bolian Liu, Delong Zhang · Published in The Australasian Journal of… 2003 · Mathematics.

Shangwang Tan, Bolian Liu, Delong Zhang: Extreme tournaments with given primitive exponents. Australas. J Comb. 28: 81-92 (2003). manage site settings.

Given a finite set X, how many topologies are there on X? This question has received much attention through the years, but continues to be unresolved. Within ...

MR0316612; Tan, S., Liu, B., Zhang, D., Extreme tournaments with given primitive exponents, Australas. J. Comb. 28 (2003), 81-91. (2003) MR1998863. NotesEmbed ...

Extreme tournaments with given primitive exponents. Article. Jan 2003. Tan ... Let e(Tn) be the primitive exponent of a primitive tournament Tn of order n.

Extreme tournaments with given primitive exponents. 81-92. view. electronic edition @ uq.edu.au (open access) · no references & citations available. export ...

Li, Generalized primitive exponents with characterizations of the extreme digraphs, Chinese Ann. Math., to appear. J.-z. Wang, Characterizations of the ...

... exponent satisfies the inequality e ≤ 5 + sn − s1. 2. Determine the exponents of the primitive tournaments with at most five nodes. Page 58. 14. scheduling ...

is primitive, the srnallest such 1 is called the exponent of G, denoted exp(G). This dissertation is an examination of the exponent of G and of other digraph ...