Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/79| Title: | Convex extendable trees |
| Authors: | K.S. Parvathy, A. Vijayakumar |
| Keywords: | Geodesic convexity Minimal path convexity Distance convex simple graphs Convex extendable trees |
| Issue Date: | 2-Sep-1998 |
| Publisher: | ELSEVIER |
| Series/Report no.: | 206(1999) 179-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, (c) 1999 Elsevier Science B.V. All rights reserved |
| URI: | http://hdl.handle.net/123456789/79 |
| Appears in Collections: | Dr.Parvathy K.S. |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Convex extendable trees.pdf | 371.95 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.