On scores in tournaments-Reference-Cited by-同舟云学术

On scores in tournaments

Published:2018-12-01 Issue:2 Volume:10 Page:257-267
ISSN:2066-7760
Container-title:Acta Universitatis Sapientiae, Informatica
language:en
Short-container-title:

Author:

Naikoo T. A.¹

Affiliation:

1. Department of Mathematics , Islamia College of Science and Commerce , Srinagar , Kashmir, India

Abstract

Abstract A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the outdegree of the vertex. In this paper, we obtain various results on the scores in tournaments.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/ausi-2018-0013

Reference25 articles.

1. [1] P. Avery, Score sequences of oriented graphs, J. Graph Theory, 15, 3 (1991) 251–257. ⇒25710.1002/jgt.3190150303

2. [2] R. A. Brualdi and J. Shen, Landau’s inequalities for tournament scores and a short proof of a Theorem on transitive sub-tournaments, J. Graph Theory, 38 (2001) 244–254. ⇒25810.1002/jgt.10008

3. [3] R. A. Brualdi and J. Shen, Landau’s inequalities for tournament scores and a short proof of a Theorem on transitive sub-tournaments, J. Graph Theory, 38 (2001) 244–254. ⇒25810.1002/jgt.10008

4. [4] J. R. Griggs and K. B. Reid, Landau’s theorem revisited, Australasian J. Combinatorics, 20 (1999) 19–24. ⇒258

5. [5] K. K. Kayibi, M. A. Khan and S. Pirzada, Uniform sampling of khypertournaments, Linear and Multilinear Algebra, 61, 1 (2012) 123–138. ⇒25710.1080/03081087.2012.664771

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Zagreb Index of T;Kragujevac Journal of Mathematics;2024