|
This article is cited in 1 scientific paper (total in 1 paper)
Minimal trees with a given vertex-search number
P. A. Golovach
Abstract:
Minimal trees with given vertex-search number (an invariant of graphs which arises in case of consideration of a search problem on a graph) are considered. Families of all such trees for a given vertex-search number have been constructed, and the problem of enumeration of the minimal trees has been solved, as well.
Received: 02.10.1991
Citation:
P. A. Golovach, “Minimal trees with a given vertex-search number”, Diskr. Mat., 4:2 (1992), 52–60
Linking options:
https://www.mathnet.ru/eng/dm730 https://www.mathnet.ru/eng/dm/v4/i2/p52
|
Statistics & downloads: |
Abstract page: | 333 | Full-text PDF : | 111 | First page: | 2 |
|