SCORE SEQUENCES IN ORIENTED GRAPHS

被引：9

作者：

Pirzada, S. ^{[1
]}

Naikoo, T. A. ^{[1
]}

Shah, N. A. ^{[1
]}

机构：

[1] Univ Kashmir, Dept Math, Srinagar 190006, Jammu & Kashmir, India

来源：

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING | 2007年 / 23卷 / 1-2期

关键词：

Oriented graph; tournament; score sequence; triples; reducible and irreducible; strongly transitive;

D O I：

10.1007/BF02831973

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An oriented graph is a digraph with no symmetric pairs of directed arcs and without loops. The score of a vertex vi in an oriented graph D is a(vi) ( or simply a(i)) = n - 1 + d(vi)(+) - d(vi)(-), where d(vi)(+) and d(vi)(-) are the outdegree and indegree, respectively, of v(i) and n is the number of vertices in D. In this paper, we give a new proof of Avery's theorem and obtain some stronger inequalities for scores in oriented graphs. We also characterize strongly transitive oriented graphs.

引用

页码：257 / 268

页数：12

共 7 条

[1] SCORE SEQUENCES OF ORIENTED GRAPHS [J].

AVERY, P .

JOURNAL OF GRAPH THEORY, 1991, 15 (03) :251-257

[2] Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments [J].

Brualdi, RA ;

Shen, J .

JOURNAL OF GRAPH THEORY, 2001, 38 (04) :244-254

[3]

LANDAU H. G., 1953, BULL MATH BIOPHYS, V15, P143, DOI 10.1007/BF02476378

[4]

Mahmoodian E. S., 1978, B IRAN MATH SOC, p1L

[5]

Pirzada S., B MALAYSIAN IN PRESS

[6]

Pirzada S., 2003, NOVI SAD J MATH, V33, P25

[7]

Thomassen C., 1981, THEORY APPL GRAPHS, P589

← 1 →