A Partial Solution to Cordial Tree Conjecture

Simple item page
dc.contributor.authorHegde, S.M.
dc.contributor.authorMurthy, T.S.
dc.date.accessioned2026-02-05T09:34:16Z
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.
dc.identifier.citationJournal of Discrete Mathematical Sciences and Cryptography, 2014, 17, 3, pp. 257-263
dc.identifier.issn9720529
dc.identifier.urihttps://doi.org/10.1080/09720529.2013.867698
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/26507
dc.publisherTaru Publications
dc.subjectAlgebra
dc.subjectCombinatorial nullstellensatz
dc.subjectHarmonious labeling
dc.subjectK-cordial labeling
dc.subjectLabelings
dc.subjectT-harmonious labeling
dc.subjectValue sets
dc.subjectForestry
dc.subjectAlgorithms
dc.subjectMathematical Analysis
dc.titleA Partial Solution to Cordial Tree Conjecture

Files

Collections

Journal Articles