Construction of all tournament matrices with prescribed row sum vector

被引：1

作者：

Hacioglu, Ilhan ^{[1
]}

Kurkcu, Burak ^{[1
]}

机构：

[1] Canakkale Onsekiz Mart Univ, Arts & Sci Fac, Dept Math, TR-17100 Canakkale, Turkey

来源：

DISCRETE APPLIED MATHEMATICS | 2014年 / 171卷

关键词：

Binary code; Tournament matrix; Generating algorithm; GRAPHS;

D O I：

10.1016/j.dam.2014.02.019

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this article, we define the binary codes of tournament matrices in the class T(R) and give unique construction algorithms for matrices which have minimum and maximum binary codes. By introducing a generating algorithm with an order we show that all matrices in class T(R) can be sorted uniquely between matrices with minimum and maximum binary codes. (C) 2014 Elsevier B.V. All rights reserved.

引用

页码：147 / 152

页数：6

共 9 条

[1] Brualdi R.A., 2006, Combinatorial Matrix Classes, VVolume 13
[2] BRUALDI RA, 1984, PROGR GRAPH THEORY, P128
[3] The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes
Chen, An Hang
Chang, Jou Ming
Wang, Yue Li
[J]. GRAPHS AND COMBINATORICS, 2009, 25 (01) : 27 - 34
[4] UPSETS IN ROUND ROBIN TOURNAMENTS
FULKERSON, DR
[J]. CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (06): : 957 - +
[5] Kannan R, 1999, RANDOM STRUCT ALGOR, V14, P293, DOI 10.1002/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO
[6] 2-G
[7] Landau HG., 1953, B MATH BIOPHYS, V15, P143, DOI [10.1007/BF02476378, DOI 10.1007/BF02476378]
[8] MCSHINE L, 2000, ELECT J COMBIN, V7
[9] Ryser H.J., 1964, RECENT ADV MATRIX TH, P103

← 1 →