Convex extendable trees

Dyuthi/Manakin Repository

Convex extendable trees

Show full item record

Title: Convex extendable trees
Author: Parvathy, K S; Vijayakumar, A
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
Date: 1999


Files in this item

Files Size Format View Description
Dyuthi-P00404.pdf 85.96Kb PDF View/Open PDF

This item appears in the following Collection(s)

Show full item record

Search Dyuthi


Advanced Search

Browse

My Account