Medians of graphs and kings of tournaments (Q1365336)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Medians of graphs and kings of tournaments |
scientific article; zbMATH DE number 1054452
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Medians of graphs and kings of tournaments |
scientific article; zbMATH DE number 1054452 |
Statements
Medians of graphs and kings of tournaments (English)
0 references
7 December 1997
0 references
It is first shown that any node-weighted graph is embeddable in another node-weighted graph for which it is the (set of) weighted medians, i.e. nodes minimising their sum of weighted distances to all other nodes. In an \(n\)-tournament (a directed complete \(n\)-graph) a transmitter (king) is a node at (directed) distance at most 1 (2) of any other node. It is shown that any \(n\)-tournament without transmitters is embeddable in some \(m\)-tournament with \(m\leq 2n-1\) in which it is the set of kings.
0 references
eccentricity
0 references
center
0 references
median
0 references
tournament
0 references
king
0 references
transmitter
0 references
