Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/80Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Karakattu S. Parvathy, Ambat Vijayakumar | - |
| dc.date.accessioned | 2016-11-08T06:44:07Z | - |
| dc.date.available | 2016-11-08T06:44:07Z | - |
| dc.date.issued | 1998-01-01 | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/80 | - |
| dc.description.abstract | A necessary and sufficient condition for the existence of a 2-connected (k,2)-convex graph is obtained. | en_US |
| dc.publisher | New York Academy of Sciences | en_US |
| dc.relation.ispartofseries | XXXIV, 15-17 (1998); | - |
| dc.subject | 2-connected (k,2)-convex graph | en_US |
| dc.title | CONVEX GRAPHS: MINIMAL PATH CONVEXITY | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Dr.Parvathy K.S. | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| CONVEX GRAPHS MINIMAL PATH CONVEXITY.PDF | 1.04 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.