AbstractA median graph is a connected graph, such that for any three vertices u,ν and w there is exactly one vertex x that lies simultaneously on a shortest (u, ν)-path a shortest (ν, w)-path and a shortest (w, u)-path. It is proved that a median graph can be obtained from a one-vertex graph by an expansion procedure. From this characterization some nice properties are derived
AbstractA hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical comp...
AbstractWe generalize the well-known relation for trees n−m=1 to the class of median graphs in the f...
In this article, we study the median path problem without length restrictions on the class of connec...
AbstractA median graph is a connected graph, such that for any three vertices u,ν and w there is exa...
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
One-to-one correspondences are established between the following combinatorial structures: (i) media...
Median graphs are connected graphs in which for all three vertices there is a unique vertex that bel...
textabstractA profile = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of v...
Definition(s): A graph G is a median graph if for every triple of vertices u, v, and w there exists ...
AbstractA median of a profile π = (x1, …, xk) of vertices of a finite connected graph G is a vertex ...
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show...
AbstractA set of vertices S in a graph is called geodetic if every vertex of this graph lies on some...
AbstractA median of a k-tuple π=(x1,…,xk) of vertices of a finite connected graph G is a vertex x fo...
International audienceThe median of a set of vertices P of a graph G is the set of all vertices x o...
AbstractA hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical comp...
AbstractWe generalize the well-known relation for trees n−m=1 to the class of median graphs in the f...
In this article, we study the median path problem without length restrictions on the class of connec...
AbstractA median graph is a connected graph, such that for any three vertices u,ν and w there is exa...
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
One-to-one correspondences are established between the following combinatorial structures: (i) media...
Median graphs are connected graphs in which for all three vertices there is a unique vertex that bel...
textabstractA profile = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of v...
Definition(s): A graph G is a median graph if for every triple of vertices u, v, and w there exists ...
AbstractA median of a profile π = (x1, …, xk) of vertices of a finite connected graph G is a vertex ...
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show...
AbstractA set of vertices S in a graph is called geodetic if every vertex of this graph lies on some...
AbstractA median of a k-tuple π=(x1,…,xk) of vertices of a finite connected graph G is a vertex x fo...
International audienceThe median of a set of vertices P of a graph G is the set of all vertices x o...
AbstractA hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical comp...
AbstractWe generalize the well-known relation for trees n−m=1 to the class of median graphs in the f...
In this article, we study the median path problem without length restrictions on the class of connec...
DOI
Add to ORKG