Almost minimum diameter orientations of semicomplete multipartite and extended digraphs

被引：6
|
作者：
Gutin, G [1 ]
Koh, KM
Tay, EG
Yeo, A
机构：
[1] Royal Holloway Univ London, Dept Comp Sci, Egham TW20 0EX, Surrey, England
[2] Natl Univ Singapore, Dept Math, Singapore 119260, Singapore
[3] Nanyang Technol Univ, Math & Math Educ Grp, Singapore 259756, Singapore
来源：
GRAPHS AND COMBINATORICS | 2002年 / 18卷 / 03期
关键词：
D O I：
10.1007/s003730200036
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x not equal y of vertices Such that both xy and yx are in D. Almost minimum diameter orientations of certain semicomplete multipartite and extended digraphs are considered, several generalizations of results on orientations of undirected graphs are obtained, some conjectures are posed.
引用
收藏
页码：499 / 506
页数：8
相关论文
共 50 条
  • [21] CYCLES AND PATHS IN SEMICOMPLETE MULTIPARTITE DIGRAPHS, THEOREMS, AND ALGORITHMS - A SURVEY
    GUTIN, G
    JOURNAL OF GRAPH THEORY, 1995, 19 (04) : 481 - 505
  • [22] The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
    Tewes, M
    Volkmann, L
    DISCRETE MATHEMATICS, 2001, 231 (1-3) : 453 - 457
  • [23] MINIMUM COST HOMOMORPHISMS TO SEMICOMPLETE BIPARTITE DIGRAPHS
    Gutin, Gregory
    Rafiey, Arash
    Yeo, Anders
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (04) : 1624 - 1639
  • [24] Semicomplete multipartite digraphs whose every arc is contained in a Hamiltonian path
    Meng, Wei
    Li, Shengjia
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 299 - +
  • [25] Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs
    Gupta, A.
    Gutin, G.
    Karimi, M.
    Kim, E.
    Rafiey, A.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 46 : 217 - 232
  • [26] The Diameter of Almost Eulerian Digraphs
    Dankelmann, Peter
    Volkmann, L.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [27] Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
    Gutin, G
    Tewes, M
    Yeo, A
    DISCRETE MATHEMATICS, 2000, 222 (1-3) : 269 - 274
  • [28] Minimum cost homomorphism dichotomy for locally in-semicomplete digraphs
    Gupta, A.
    Karimi, M.
    Kim, E. J.
    Rafiey, A.
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 374 - +
  • [29] ON THE DIAMETER OF ALMOST ALL DIGRAPHS.
    Filipponi, P.
    Note, recensioni, notizie, 1981, 30 (02): : 78 - 81
  • [30] The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
    Gutin, Gregory
    Kim, Eun Jung
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (04) : 319 - 330
12345