summary:The known relation between the standard radius and diameter holds for graphs, but not for digraphs. We show that no upper estimation is possible for digraphs. We also give some remarks on distances, which are either metric or non-metric
We prove the following theorem. If G is a connected finite graph of order p, and S is a k-subset of ...
International audienceIn this paper, we propose a new algorithm that computes the radius and the dia...
We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter ...
summary:The known relation between the standard radius and diameter holds for graphs, but not for di...
AbstractLet D be a strong digraph. The strong distance between two vertices u and v in D, denoted by...
summary:The diameter of a graph $G$ is the maximal distance between two vertices of $G$. A graph $G$...
AbstractLet D be a strongly connected digraph. The strong distance between two vertices u and v in D...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
We introduce notions of certificates allowing to bound eccentricities in a graph. In particular , we...
Abstract. Let G be a graph of radius r and diameter d with d ≤ 2r − 2. We show that G contains a cyc...
summary:For a nonempty set $S$ of vertices in a strong digraph $D$, the strong distance $d(S)$ is th...
[[abstract]]Suppose G = (V, E) is a graph and D = (V, F) is a strong digraph of G. Let u and v be tw...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
Abstract. We introduce the concept of (k, l)-radius of a graph and prove that for any fixed pair k, ...
In this paper, we propose a new algorithm that computes the radius and the diameter of a weakly conn...
We prove the following theorem. If G is a connected finite graph of order p, and S is a k-subset of ...
International audienceIn this paper, we propose a new algorithm that computes the radius and the dia...
We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter ...
summary:The known relation between the standard radius and diameter holds for graphs, but not for di...
AbstractLet D be a strong digraph. The strong distance between two vertices u and v in D, denoted by...
summary:The diameter of a graph $G$ is the maximal distance between two vertices of $G$. A graph $G$...
AbstractLet D be a strongly connected digraph. The strong distance between two vertices u and v in D...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
We introduce notions of certificates allowing to bound eccentricities in a graph. In particular , we...
Abstract. Let G be a graph of radius r and diameter d with d ≤ 2r − 2. We show that G contains a cyc...
summary:For a nonempty set $S$ of vertices in a strong digraph $D$, the strong distance $d(S)$ is th...
[[abstract]]Suppose G = (V, E) is a graph and D = (V, F) is a strong digraph of G. Let u and v be tw...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
Abstract. We introduce the concept of (k, l)-radius of a graph and prove that for any fixed pair k, ...
In this paper, we propose a new algorithm that computes the radius and the diameter of a weakly conn...
We prove the following theorem. If G is a connected finite graph of order p, and S is a k-subset of ...
International audienceIn this paper, we propose a new algorithm that computes the radius and the dia...
We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter ...
DOI
Add to ORKG