Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/83Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Jorry T.F, Parvathy K.S. Sr | - |
| dc.date.accessioned | 2016-11-08T07:03:02Z | - |
| dc.date.available | 2016-11-08T07:03:02Z | - |
| dc.date.issued | 2015-12-01 | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/83 | - |
| dc.description.abstract | In this paper family of Uniformly Segregated Trees (UST) and some of their properties are studied. The formula to find number of vertices for each k segregated tree is found. The increase in the number of vertices in Skin as of vertices of degree m increase is also determined. The method to construct higher (with regard to maximum degree) k-segregated trees from the lower k-segregated trees is discussed | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Bulletin of Kerala Mathematics Association | en_US |
| dc.relation.ispartofseries | Vol.12, No.2, (2015 December);135-143 | - |
| dc.subject | Uniformly segregated tree | en_US |
| dc.subject | k-segregated tree | en_US |
| dc.subject | totally segregated tree | en_US |
| dc.title | UNIFORMLY SEGREGATED TREES | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Dr.Parvathy K.S. | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| UNIFORMLY SEGREGATED TREES.PDF | 1.14 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.