Median graphs are characterized among direct products of graphs on at least three vertices. Beside some trivial cases, it is shown that one component of G×P₃ is median if and only if G is a tree in that the distance between any two vertices of degree at least 3 is even. In addition, some partial results considering median graphs of the form G×K₂ are proved, and it is shown that the only nonbipartite quasi-median direct product is K₃×K₃
summary:Two numerical invariants $\Delta(G)$ and $\Gamma(G)$ of a graph, related to the concept of m...
The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that...
The median of a set of vertices P of a graph G is the set of all vertices x of G minimizing the sum ...
Median graphs are characterized among direct products of graphs on at least three vertices. Beside s...
A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which mi...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of...
The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and ...
Definition(s): A graph G is a median graph if for every triple of vertices u, v, and w there exists ...
textabstractA profile = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of v...
AbstractA median graph is a connected graph, such that for any three vertices u,ν and w there is exa...
One-to-one correspondences are established between the following combinatorial structures: (i) media...
For any vertex v and any edge e in a non-trivial connected graph G, the distance sum d(v) of v is $d...
International audienceThe median of a set of vertices P of a graph G is the set of all vertices x o...
AbstractThe median of a profile π=(u1,…,uk) of vertices of a graph G is the set of vertices x that m...
summary:Two numerical invariants $\Delta(G)$ and $\Gamma(G)$ of a graph, related to the concept of m...
The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that...
The median of a set of vertices P of a graph G is the set of all vertices x of G minimizing the sum ...
Median graphs are characterized among direct products of graphs on at least three vertices. Beside s...
A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which mi...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of...
The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and ...
Definition(s): A graph G is a median graph if for every triple of vertices u, v, and w there exists ...
textabstractA profile = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of v...
AbstractA median graph is a connected graph, such that for any three vertices u,ν and w there is exa...
One-to-one correspondences are established between the following combinatorial structures: (i) media...
For any vertex v and any edge e in a non-trivial connected graph G, the distance sum d(v) of v is $d...
International audienceThe median of a set of vertices P of a graph G is the set of all vertices x o...
AbstractThe median of a profile π=(u1,…,uk) of vertices of a graph G is the set of vertices x that m...
summary:Two numerical invariants $\Delta(G)$ and $\Gamma(G)$ of a graph, related to the concept of m...
The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that...
The median of a set of vertices P of a graph G is the set of all vertices x of G minimizing the sum ...