AbstractA diameter critical graph has the property that the addition of any edge decreases the diameter. All such graphs are determined for a given vertex connectivity and the edge number is given
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
We define a graph G=(V, E) with m=\E\ edges, n=\V\ vertices, maximum degree D, and diameter d, to b...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
AbstractA graph G is diameter k-critical if the graph has diameter k and the deletion of any edge in...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
summary:The diameter of a graph $G$ is the maximal distance between two vertices of $G$. A graph $G$...
AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
AbstractThe eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G)...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractA graph G is domination dot-critical, or just dot-critical, if contracting any edge decrease...
AbstractA graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increa...
A diameter-2-critical (D2C) graph is a graph with diameter two such that removing any edge increases...
AbstractA graph G is diameter 2-critical if its diameter is two and the deletion of any edge increas...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
We define a graph G=(V, E) with m=\E\ edges, n=\V\ vertices, maximum degree D, and diameter d, to b...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
AbstractA graph G is diameter k-critical if the graph has diameter k and the deletion of any edge in...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
summary:The diameter of a graph $G$ is the maximal distance between two vertices of $G$. A graph $G$...
AbstractA simple connected graph G with diam(G) = d is said to be ‘vertex diameter-d-critical’ if di...
AbstractThe eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G)...
AbstractA graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge incr...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractA graph G is domination dot-critical, or just dot-critical, if contracting any edge decrease...
AbstractA graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increa...
A diameter-2-critical (D2C) graph is a graph with diameter two such that removing any edge increases...
AbstractA graph G is diameter 2-critical if its diameter is two and the deletion of any edge increas...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
AbstractA graph is vertex-critical if deleting any vertex increases its diameter. We construct, for ...
We define a graph G=(V, E) with m=\E\ edges, n=\V\ vertices, maximum degree D, and diameter d, to b...
DOI
Add to ORKG