Premium
Toppling kings in a tournament by introducing new kings
Author(s) -
Jing Huang,
Weixuan Li
Publication year - 1987
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190110103
Subject(s) - tournament , vertex (graph theory) , combinatorics , mathematics , set (abstract data type) , discrete mathematics , graph , computer science , programming language
A king of a tournament is a vertex which can reach any other vertex within two steps. Let K be the king set of a tournament T . A subset M of K is c ‐topplable if there exists a supertournament T * of T such that there is a set N of c vertices in T * – T and ( K – M ) U N is exactly the king set of T *. A characterization of c ‐topplable sets of kings is given in this paper.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom