Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/9687Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hegde, S.M. | |
| dc.contributor.author | Murthy, T.S. | |
| dc.date.accessioned | 2020-03-31T06:51:18Z | - |
| dc.date.available | 2020-03-31T06:51:18Z | - |
| dc.date.issued | 2014 | |
| dc.identifier.citation | Journal of Discrete Mathematical Sciences and Cryptography, 2014, Vol.17, 3, pp.257-263 | en_US |
| dc.identifier.uri | 10.1080/09720529.2013.867698 | |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/9687 | - |
| dc.description.abstract | Abstract: In this paper, we prove the weak harmonious tree conjecture by Andrzej ?ak (2009) using the value sets of polynomials. Consequently, it partially proves the cordial tree conjecture by Mark Hovey (1991), that is all trees of order n < p are p-cordial, where p is a prime. 2014, Taru Publications. | en_US |
| dc.title | A Partial Solution to Cordial Tree Conjecture | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 1. Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.