|
This article is cited in 1 scientific paper (total in 1 paper)
Computer science
Minimal edge extensions of palm trees
D. D. Komarov Saratov State University, Russia, 410012, Saratov, Astrahanskaya st., 83
Abstract:
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.
Key words:
minimal extensions of graphs.
Citation:
D. D. Komarov, “Minimal edge extensions of palm trees”, Izv. Saratov Univ. Math. Mech. Inform., 13:3 (2013), 99–104
Linking options:
https://www.mathnet.ru/eng/isu426 https://www.mathnet.ru/eng/isu/v13/i5/p99
|
Statistics & downloads: |
Abstract page: | 188 | Full-text PDF : | 66 | References: | 45 |
|