This article is cited in 5 papers

The total vertex separation number and the profile of graphs

P. A. Golovach, F. V. Fomin


Abstract: We consider two graph invariants determined via optimal (in some sense) enumerations of the vertices. They are the total vertex separation number and the profile of a graph. We demonstrate that these two invariants coincide and give some properties of the profile of a graph derived from this coincidence.
This research was supported by the Russian Foundation for Basic Research, grant 96–02–00285.

UDC: 519.717

Received: 09.02.1996

DOI: 10.4213/dm410

 English version: Discrete Mathematics and Applications, 1998, 8:1, 73–80

Bibliographic databases:

• 
•