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.