flag flag  

On the Steiner, geodetic and hull numbers of graphs

Description : Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W) the Steiner interval of W. If S(W) = V (G), then we call W a Steiner set of G. The minimum order of a...
Language(s) : English
Subject(s) : Graph theory , Chordal graph , Convexity , geodesic , geodetic set , geodetic number , hull number , monophonic path , monophonic set , Steiner set , Steiner number , Grafs, Teoria de , /Classificació AMS/05 Combinatorics/05C Graph theory
Publisher(s) :
Contributor(s) : Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
Source(s) :
Publication Date(s) : 2003-01-01