The total vertex separation number and the profile of graphs
Diskretnaya Matematika, Tome 10 (1998) no. 1, pp. 87-94
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
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.