Pirzada, S.; Merajuddin; Samee, U. On oriented graph scores. (English) Zbl 1199.05154 Mat. Vesn. 60, No. 3, 187-191 (2008). The score of a vertex \(v\) in an oriented graph on \(n\) vertices is \(a_v=n - 1 + d_v^+ -d_v^-\), where \(d_v^+\) and \(d_v^-\) are outdegree and indegree of \(v\), respectively. The set of distinct scores of the vertices in an oriented graph is called a score set.The authors give new proof of a known result of P. Avery giving necessary and sufficient conditions for a non-negative sequence of integers to be a score in an oriented graph. Reviewer: Zoran Stanić (Beograd) Cited in 1 Document MSC: 05C20 Directed graphs (digraphs), tournaments Keywords:digraphs; tournaments; vertex-degrees × Cite Format Result Cite Review PDF Full Text: EuDML