Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 2013, Volume 13, Issue 3, Pages 99–104
Minimal edge extensions of palm trees
D. D. Komarov
Saratov State University, Russia, 410012, Saratov, Astrahanskaya st., 83
Minimal edge extension of graphs can be regarded as a model of optimal edge fault tolerant implementation of a system. The problem of finding the minimal edge extensions of an arbitrary graph is NP-complete, that's why it is of interest to find classes of graphs for which it is possible to build a minimal edge extension analytically. This paper is about of the one-edge extensions of a graphs from a special class named palm trees. In this paper presents a kind of one-edge extension for some palm trees and the proof that it is minimal.
minimal extensions of graphs.
PDF file (234 kB)
D. D. Komarov, “Minimal edge extensions of palm trees”, Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 13:3 (2013), 99–104
Citation in format AMSBIB
\paper Minimal edge extensions of palm trees
\jour Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|