A median graph is a specific type of graph in graph theory that has a distinctive property related to distances between its vertices. In particular, a median graph is defined as a graph in which, for any three vertices \( u, v, w \), the distance between any two of these vertices is less than or equal to the sum of the distances from the third vertex to the two others.