summary:We define digraphs minimal, critical, and maximal by three types of radii. Some of these classes are completely characterized, while for the others it is shown that they are large in terms of induced subgraphs
For a strongly connected digraph D the restricted arc-connectivity λ'(D) is defined as the minimum c...
<pre>The degree/diameter problem for directed graphs is the problem of determining the largest possi...
AbstractThe radius and diameter of a graph are known to satisfy the relation rad G ≤ diam G ≤ 2 rad ...
summary:We define digraphs minimal, critical, and maximal by three types of radii. Some of these cla...
summary:The paper gives an overview of results for radially minimal, critical, maximal and stable gr...
A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digr...
We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter ...
summary:The eccentricity $e(v)$ of a vertex $v$ is defined as the distance to a farthest vertex from...
AbstractIt was conjectured by Caccetta and Häggkvist in 1978 that the girth of every digraph with n ...
AbstractIn this paper we prove that any R-digraph is an induced subdigraph of an infinite set of R-d...
summary:The known relation between the standard radius and diameter holds for graphs, but not for di...
AbstractLet G=(V, A) be a digraph on n vertices with maximum degree Δ and diameter D, so that n⩽n(Δ,...
A k-geodetic digraph with minimum out-degree d has excess ϵ if it has order M(d,k)+ϵ, where M(d,k) r...
In a graph G, the distance d(u, v) between a pair of vertices u and v is the length of a shortest pa...
AbstractDigraphs in which any two vertices have different pairs of semi-degrees are called fully irr...
For a strongly connected digraph D the restricted arc-connectivity λ'(D) is defined as the minimum c...
<pre>The degree/diameter problem for directed graphs is the problem of determining the largest possi...
AbstractThe radius and diameter of a graph are known to satisfy the relation rad G ≤ diam G ≤ 2 rad ...
summary:We define digraphs minimal, critical, and maximal by three types of radii. Some of these cla...
summary:The paper gives an overview of results for radially minimal, critical, maximal and stable gr...
A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digr...
We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter ...
summary:The eccentricity $e(v)$ of a vertex $v$ is defined as the distance to a farthest vertex from...
AbstractIt was conjectured by Caccetta and Häggkvist in 1978 that the girth of every digraph with n ...
AbstractIn this paper we prove that any R-digraph is an induced subdigraph of an infinite set of R-d...
summary:The known relation between the standard radius and diameter holds for graphs, but not for di...
AbstractLet G=(V, A) be a digraph on n vertices with maximum degree Δ and diameter D, so that n⩽n(Δ,...
A k-geodetic digraph with minimum out-degree d has excess ϵ if it has order M(d,k)+ϵ, where M(d,k) r...
In a graph G, the distance d(u, v) between a pair of vertices u and v is the length of a shortest pa...
AbstractDigraphs in which any two vertices have different pairs of semi-degrees are called fully irr...
For a strongly connected digraph D the restricted arc-connectivity λ'(D) is defined as the minimum c...
<pre>The degree/diameter problem for directed graphs is the problem of determining the largest possi...
AbstractThe radius and diameter of a graph are known to satisfy the relation rad G ≤ diam G ≤ 2 rad ...
DOI
Add to ORKG