A Partial Solution to Cordial Tree Conjecture

dc.contributor.authorHegde, S.M.
dc.contributor.authorMurthy, T.S.
dc.date.accessioned2020-03-31T06:51:18Z
dc.date.available2020-03-31T06:51:18Z
dc.date.issued2014
dc.description.abstractAbstract: 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.identifier.citationJournal of Discrete Mathematical Sciences and Cryptography, 2014, Vol.17, 3, pp.257-263en_US
dc.identifier.uri10.1080/09720529.2013.867698
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/9687
dc.titleA Partial Solution to Cordial Tree Conjectureen_US
dc.typeArticleen_US

Files