Geodesic
Minimal vertex $1$-extensions of palm trees
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 14 (2014) no. 2, pp. 233-241

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

Minimal vertex $1$-extension of graphs can be regarded as a model of optimal $1$-node fault tolerant implementation of a system. This paper is about of the $1$-vertex extensions of a graphs from a special class named palm trees.This article presents a solution to the problem of finding the minimal vertex $1$-extension of palm trees with two leafs. 
@article{ISU_2014_14_2_a11,
     author = {D. D. Komarov},
     title = {Minimal vertex $1$-extensions of palm trees},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {233--241},
     publisher = {mathdoc},
     volume = {14},
     number = {2},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2014_14_2_a11/}
}
TY  - JOUR
AU  - D. D. Komarov
TI  - Minimal vertex $1$-extensions of palm trees
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2014
SP  - 233
EP  - 241
VL  - 14
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2014_14_2_a11/
LA  - ru
ID  - ISU_2014_14_2_a11
ER  - 
%0 Journal Article
%A D. D. Komarov
%T Minimal vertex $1$-extensions of palm trees
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2014
%P 233-241
%V 14
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2014_14_2_a11/
%G ru
%F ISU_2014_14_2_a11
D. D. Komarov. Minimal vertex $1$-extensions of palm trees. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 14 (2014) no. 2, pp. 233-241. http://geodesic.mathdoc.fr/item/ISU_2014_14_2_a11/