The article examines the center and median problems on graphs with special structure. In scientific works these are frequently called location problems on graphs. Although efficient solutions for graphs with some well-known properties have been found, in general case the problem remains complex. In this paper the structure of median and center in a d-convex simple planargraph Gis studied.We evaluate the connection between median/center of a graph Gwith mentioned properties and median/center of a tree, determined by G.
