RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics // Archive

Izv. Saratov Univ. Math. Mech. Inform., 2014 Volume 14, Issue 2, Pages 233–241 (Mi isu505)

Computer science

Minimal vertex $1$-extensions of palm trees

D. D. Komarov

Saratov State University, 83, Astrakhanskaya str., 410012, Saratov, Russia

Abstract: 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.

Key words: graphs, minimal extensions of graphs, fault tolerance, palm trees, star-like trees.

UDC: 519.17

DOI: 10.18500/1816-9791-2014-14-2-233-241



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025