A nonnegative matrix T = (t~)~= t is a generalized transitive tournament matrix (GTT matrix) ift, = 0, t~ = 1 -tjl for i ~j, and 1 ~< t~ i + t~. + tk~ ~< 2 for i,j,k pairwise distinct. An approach to the problem of characterize the set of vertices of the polytope {GTT }, of all GTT matrices of order
✦ LIBER ✦
∗-graphs of vertices of the generalized transitive tournament polytope
✍ Scribed by Alberto Borobia; Valerio Chumillas
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 375 KB
- Volume
- 179
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Vertices of the generalized transitive t
✍
Alberto Borobia
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 249 KB
(0, ½, 1) matrices which are extreme poi
✍
Alberto Borobia
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 735 KB
On non-{0, 1/2, 1} extreme points of the
✍
Zeev Nutov; Michal Penn
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 609 KB
The vertices of the knapsack polytope
✍
A.C. Hayes; D.G. Larman
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 222 KB
Adjacency of vertices of the complete pr
✍
Maria Angela C.M. Gurgel; Yoshiko Wakabayashi
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 457 KB
The domination and competition graphs of
✍
Fisher, David C.; Lundgren, J. Richard; Merz, Sarah K.; Reid, K. B.
📂
Article
📅
1998
🏛
John Wiley and Sons
🌐
English
⚖ 230 KB
👁 2 views
Vertices x and y dominate a tournament T if for all vertices z / = x, y, either x beats z or y beats z. Let dom(T ) be the graph on the vertices of T with edges between pairs of vertices that dominate T . We show that dom(T ) is either an odd cycle with possible pendant vertices or a forest of cater