Geodesic
Upper bound for the number of additional edges in minimal $1$-edge extensions of starlike trees
Prikladnaâ diskretnaâ matematika, no. 4 (2015), pp. 91-99

Voir la notice de l'article provenant de la source Math-Net.Ru

Minimal edge extension of graphs can be regarded as a model of optimal edge fault tolerant implementation of a system. This paper is about an upper bound for the number of additional edges in minimal $1$-edge extensions for graphs of a special class – starlike trees. Two schemes for constructing $1$-edge extensions for any kind starlike trees and an algorithm based on these schemes are proposed.
Keywords: graphs, minimal extensions of graphs, fault tolerance, starlike trees. 
@article{PDM_2015_4_a8,
     author = {D. D. Komarov},
     title = {Upper bound for the number of additional edges in minimal $1$-edge extensions of starlike trees},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {91--99},
     publisher = {mathdoc},
     number = {4},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2015_4_a8/}
}
TY  - JOUR
AU  - D. D. Komarov
TI  - Upper bound for the number of additional edges in minimal $1$-edge extensions of starlike trees
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2015
SP  - 91
EP  - 99
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2015_4_a8/
LA  - ru
ID  - PDM_2015_4_a8
ER  - 
%0 Journal Article
%A D. D. Komarov
%T Upper bound for the number of additional edges in minimal $1$-edge extensions of starlike trees
%J Prikladnaâ diskretnaâ matematika
%D 2015
%P 91-99
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2015_4_a8/
%G ru
%F PDM_2015_4_a8
D. D. Komarov. Upper bound for the number of additional edges in minimal $1$-edge extensions of starlike trees. Prikladnaâ diskretnaâ matematika, no. 4 (2015), pp. 91-99. http://geodesic.mathdoc.fr/item/PDM_2015_4_a8/