Title of article
Convex extendable trees Original Research Article
Author/Authors
K.S. Parvathy، نويسنده , , A. Vijayakumar، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
7
From page
179
To page
185
Abstract
The concept of convex extendability is introduced to answer the problem of finding the smallest distance convex simple graph containing a given tree. A problem of similar type with respect to minimal path convexity is also discussed.
Keywords
Minimal path convexity , Convex extendable trees , Distance convex simple graphs , Geodesic convexity
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950932
Link To Document