競賽圖
An enumeration problem is solved for labeled consistent bipartite tournaments,and a sharp formula is obtained. 通過討論,解決了標(biāo)定一致二部競賽圖的計數(shù)問題,并獲得了一個簡明計算公式。
In this paper, we study the transitive properties of bipartite tournaments and tournaments, and give the sufficient and necessary conditions of them. 摘要研究了二部競賽圖和競賽圖的傳遞性,給出了它的充分必要條件。