This article is cited 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.

UDC: 519.977

Received: 02.10.1991

Bibliographic databases:

• 
•