Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/79Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | K.S. Parvathy, A. Vijayakumar | - |
| dc.date.accessioned | 2016-11-08T06:25:06Z | - |
| dc.date.available | 2016-11-08T06:25:06Z | - |
| dc.date.issued | 1998-09-02 | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/79 | - |
| dc.description.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 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | ELSEVIER | en_US |
| dc.relation.ispartofseries | 206(1999) 179-185; | - |
| dc.subject | Geodesic convexity | en_US |
| dc.subject | Minimal path convexity | en_US |
| dc.subject | Distance convex simple graphs | en_US |
| dc.subject | Convex extendable trees | en_US |
| dc.title | Convex extendable trees | en_US |
| dc.type | Article | en_US |
| 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.