Premium
Medians of arbitrary graphs
Author(s) -
Slater Peter J.
Publication year - 1980
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.3190040408
Subject(s) - combinatorics , mathematics , vertex (graph theory) , neighbourhood (mathematics) , graph , wheel graph , median , vertex connectivity , bound graph , discrete mathematics , graph power , line graph , geometry , mathematical analysis
For each vertex u in a connected graph H , the distance of u is the sum of the distances from u to each of the vertices v of H. A vertex of minimum distance in H is called a median vertex. It is shown that for any graph G there exists a graph H for which the subgraph of H induced by the median vertices is isomorphic to G .
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