摘要
D=(V,A)为一个有向图,其中,V为顶点集,A为弧集,A中的元素是有序对(u,v),称为弧。设u和v是有向图D的两个顶点,若从u到v存在一条有向路,则称顶点v是从u可达的,或称从u可达v。若有向图D中任何两个顶点是互相可达的,则称D为强连通图。若有向图T中任意两个顶点之间恰有一条弧,则称T为竞赛图。一个强连通的竞赛图T称为强竞赛图。论文研究顶点个数大于的强竞赛图T的性质,并利用该性质给出了Moon定理的另外一种证明。
Abstract： D=（V,A ） is a directed graph where V is the vertex set of D and A is a collection of ordered pair of the vertices（u, v） ,called are.That v can be reached from u or v can reach u means there is a directed path from u to v.A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.A tournament T is a directed graph in which there is exactly one arc between any two vertices.A strongly connected tournament is called a strong tournament. In this paper we discuss the property of the strong tournament with at least four vertices and give out another proof of Moon theorem by the particular property.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第6期40-41,共2页
Computer Engineering and Applications
关键词
有向图
强连通图
竞赛图
directed graph
strongly connected graph
tournament
