Please use this identifier to cite or link to this item:
Title: On the kings and kings-of-kings in semicomplete multipartite digraphs
Authors: Tan, B.P. 
Keywords: Distances
Multipartite tournaments
Semicomplete multipartite digraphs
Issue Date: 28-Feb-2005
Citation: Tan, B.P. (2005-02-28). On the kings and kings-of-kings in semicomplete multipartite digraphs. Discrete Mathematics 290 (2-3) : 249-258. ScholarBank@NUS Repository.
Abstract: Koh and Tan showed in (Evaluation of the number of kings in a multipartite tournament, submitted for publication.) that the subdigraph induced by the 4-kings of an n-partite tournament with no transmitters, where n≥3, contains no transmitters. We extend this result to the class of semicomplete n-partite digraph, where n≥2. Let T be a semicomplete multipartite digraph with no transmitters and let Kr(T) denote the set of r-kings of T. Let Q be the subdigraph of T induced by K4(T). In this paper, we (1) show that Q has no transmitters, (2) obtain some results on the 2-kings, 3-kings and 4-kings in T. While it is trivial that K4(Q)⊆K4(T), we further prove that (3) K3(Q)⊆K3(T) and (4) K2(Q)=K2(T). Maurer (Math. Mag. 53 (1980) 67) introduced the concept of kings-of-kings in tournaments. Following Maurer, we investigate the r-kings-of-kings of semicomplete multipartite digraphs with no transmitters for r=1,2,3,4. Some problems on the r-kings-of-kings are posed. © 2004 Elsevier B.V. All rights reserved.
Source Title: Discrete Mathematics
ISSN: 0012365X
DOI: 10.1016/j.disc.2004.10.013
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Feb 19, 2019


checked on Feb 11, 2019

Page view(s)

checked on Jan 18, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.