Hegde, S.M.Murthy, T.S.2026-02-052014Journal of Discrete Mathematical Sciences and Cryptography, 2014, 17, 3, pp. 257-2639720529https://doi.org/10.1080/09720529.2013.867698https://idr.nitk.ac.in/handle/123456789/26507Abstract: 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.AlgebraCombinatorial nullstellensatzHarmonious labelingK-cordial labelingLabelingsT-harmonious labelingValue setsForestryAlgorithmsMathematical Analysis