Jun 17, 2014 · A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any ...
A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any pair of ...
PDF | A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any pair.
Aug 17, 1993 · graph, there are no other minimum self-repairing graphs. Here again, we will consider level graphs of minimum self-repairing graphs defined wrt.
A graph is self-repairing if it is 2-connected and such that the re- moval of any single vertex results in no increase in distance between.
The authors determined the minimum number of edges in such graphs called self-repairing graphs and characterize the class of such minimum graphs in term of size ...
A graph G is k-self-repairing, where k is a non-negative integer, if after the removal of any vertex no distance in the surviving graph increase by more than k.
People also ask
What is the minimum degree condition for connected graphs?
What is the minimum covering in graph theory?
What is an example of a self-loop on a graph?
What is the fixing number of a graph?
Oct 22, 2024 · We show that a graph on n≥4 vertices with at least n 2 -3n+6 2 edges is necessarily a self-repairing graph and that this is the best possible ...
A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any pair of remaining ...
We will show that the minimum number of edges in a self- repairing graph with n vertices is 2n - 4 and determine the class of all such mini- mum size self- ...