Score Sequences of Tournaments with Repeated Values
Keywords:
Tournament, Score, Score Sequence.Abstract
In this paper we define score sequences with repetitions. The strong score sequences with a single repetition of length four are characterized and the total number of strong score sequences with a single repetition is obtained. We characterize the self-converse strong score sequences with a single repetition of length three and five and report the number of self-converse strong score sequences with a single repetition. In last we conjecture a result to find the number of self-converse strong score sequences with a single repetition of order n.
References
- Chen G, Piotroswski W and Shreve Werren (1995), "Degree sequences with single repetitions", Congr. Numer. Vol. 106, pp. 27-32.
- Eplett, W J R (1979), "Self-converse tournaments", Canad. Math. Bull. Vol. 22, 23-27.
- Landau, H G(1953), "On dominance relations and the structure of animal societies, III: The condition for a score structure", Bull. Math. Biophysics Vol. 15, pp. 143-148.
- Reid, K B(1996), "Tournaments: Scores, kings, generalizations and special topics, In: Surveys on Graph Theory (edited by G. Chartrand and M. Jacobson)", Congr. Numer. Vol. 115, pp. 171-211.
- Ankit Garg, Arpit Goel and Amitabha Tripathi(2011), "Constructive extensions of two results on graphic sequences", Discrete Applied Mathematics Vol. 159, pp. 2170–2174
- mitabha Tripathi and Himanshu Tyagi (2008), A simple criterion on degree sequences of graphs, Discrete Applied Mathematics Vol. 156, No. 18, 3513-3517.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET

This work is licensed under a Creative Commons Attribution 4.0 International License.