|
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.
Citation:
D. D. Komarov, “Minimal vertex $1$-extensions of palm trees”, Izv. Saratov Univ. Math. Mech. Inform., 14:2 (2014), 233–241
Linking options:
https://www.mathnet.ru/eng/isu505 https://www.mathnet.ru/eng/isu/v14/i2/p233
|
Statistics & downloads: |
Abstract page: | 207 | Full-text PDF : | 63 | References: | 66 |
|