Add to ORKGIn this paper we study the graphs such that the deletion of any edge does not increase the diameter. We give some upper bounds for the order of such a graph with given maximum degree and diameter. On the other hand construction of graphs provide lower bounds. As usual, for this kind of problems, there is often a gap between these two bounds.Peer Reviewe
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
In graph theory, the term critical is usually used with respect to specified graph parameter P and ...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
AbstractLet f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractWe characterize graphs of large enough order or large enough minimum degree which contain ed...
WOS: 000451344700005The diameter of a graph gives the length of the longest path among all the short...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
Concern about fault tolerance in the design of interconnection networks has aroused interest in find...
We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge c...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
A simple undirected connected graph with minimum degree K is said to be K-restrained. Thus the class...
A graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increases the di...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
In graph theory, the term critical is usually used with respect to specified graph parameter P and ...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
AbstractLet f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractWe characterize graphs of large enough order or large enough minimum degree which contain ed...
WOS: 000451344700005The diameter of a graph gives the length of the longest path among all the short...
<p>A graph is called diameter-k-critical if its diameter is k, and the removal of any edge strictly ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
Concern about fault tolerance in the design of interconnection networks has aroused interest in find...
We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge c...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
A simple undirected connected graph with minimum degree K is said to be K-restrained. Thus the class...
A graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increases the di...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
In graph theory, the term critical is usually used with respect to specified graph parameter P and ...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...