Name
Abstract | ||
|---|---|---|
The vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation of a complete c-partite graph. Let V 1,V 2,...,V c be the partite sets of D. If there exist two vertex disjoint cycles C and C驴 in D such that V i 驴 (V(C) 驴 V(C驴)) 驴 驴 for all i = 1,2,..., c, then D is cycle componentwise complementary. The global irregularity of D is defined by $i_{\mathrm{g}}(D)=\max\{\max(d^{+}(x),d^{-}(x))-\min(d^{+}(y),d^{-}(y))|x,y\in V(D)\}$ over all vertices x and y of D (x = y is admissible), where d + (x) and d 驴(x) are the outdegree and indegree of x, respectively. If i g(D) ≤ 1, then D is almost regular. In this paper, we consider a special kind of multipartite tournaments which are almost regular 3-partite tournaments, and we show that each almost regular 3-partite tournament D is cycle componentwise complementary, unless D is isomorphic to D 3,2. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72588-6_57 | International Conference on Computational Science (3) |
Keywords | Field | DocType |
tournament | Discrete mathematics,Graph,Combinatorics,Tournament,Multipartite,Disjoint sets,Vertex (geometry),Isomorphism,Mathematics,Digraph | Conference |
Volume | Issue | ISSN |
4489 LNCS | PART 3 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhihong He | 1 | 30 | 4.12 |
| Guojun Li | 2 | 270 | 37.39 |
| Dawei Ding | 3 | 100 | 15.43 |
| Quanhui Liu | 4 | 24 | 3.16 |