几乎2-强二部竞赛图及其得分序列(英文)  

Nearly 2-Strong Bipartite Tournaments and Their Score Sequences

作　　者：尹建华[1] 

机构地区：[1]海南大学信息学院应用数学系,海南海口570228

出　　处：《徐州师范大学学报（自然科学版）》2003年第4期1-6,共6页Journal of Xuzhou Normal University(Natural Science Edition)

基　　金：Doctoral foundation of Hainan University(20030917)

摘　　要：设Tm,n=(X,Y,E)是一个m×n二部竞赛图,且s(v)表示v在Tm,n中的得分.对于u∈Y,记L(u)={v∈V(Tm,n)|u→v且s(v)=n-1}和J(u)={v∈V(Tm,n)|v→u且s(v)=1}.对于v∈X,L(v)和J(v)的定义是类似的.一个强的二部竞赛图Tm,n称为是几乎2-强的,如果对于每一个x∈V(Tm,n),Tm,n-x-L(x)-J(x)是强的.刻划了蕴含几乎2-强二部得分序列的特征.此结论包含了蕴含2-强二部得分序列的特征.Let Tm,n=(X,Y,E) be an m×n bipartite tournament,and s(v) denotes the score of v in Tm,n. For u∈Y, denote L(u) ={v∈ V(Tm,n)|u→v且s(v)=n-1}和J(u)={v∈V(Tm,n)|v→u且s(v)=1}.For v∈X,the definitions of L(v) and J(v) are similar. A strong bipartite tournament Tm,n, is said to be nearly 2-strong,if Tm,n-x-L(x)-J (x) is strong for every x#V(Tm,n). The paper characterizes the potentially nearly 2-strong bipartite score sequences, which implies the characterization of the potentially 2-strong bipartite score sequences.

关 键 词：几乎2-强 二部竞赛图 二部得分序列 单顶点扩张 

分 类 号：O157.5[理学—数学]