You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
MEDIANS OF GRAPHS AND KINGS OF TOURNAMENTS
Hai-Yen Lee, 李海晏, Gerard J. Chang and 張鎭華
Taiwanese Journal of Mathematics
Vol. 1, No. 1 (March 1997), pp. 103-110
Published by: Mathematical Society of the Republic of China
Stable URL: http://www.jstor.org/stable/43834464
Page Count: 8
You can always find the topics here!Topics: Vertices, Transmitters, Weighting functions, Graph theory, Integers, Applied mathematics
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We first prove that for any graph G with a positive vertex weight function w, there exists a graph H with a positive weight function wʹ such that w(v)=wʹ(v) for all vertices v in G and whose wʹ-median is G. This is a generalization of a previous result for the case in which all weights are 1. The second result is that for any n-tournament T without transmitters, there exists an integer m ≤ 2n—1 and an m-tournament Tʹ whose kings are exactly the vertices of T. This improves upon a previous result for m ≤ 2n.
Taiwanese Journal of Mathematics © 1997 Mathematical Society of the Republic of China