Browsing e-SCHOLARSHIP by Author "Parvathy, K S"

Dyuthi/Manakin Repository

Now showing items 1-1 of 1

Parvathy, K S; Vijayakumar,A (Elsevier, 1999)

[+]

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.
URI:	http://dyuthi.cusat.ac.in/purl/2861

Files	Size
Dyuthi-P00404.pdf	(88.02Kb)

Now showing items 1-1 of 1