A Partial Solution to Cordial Tree Conjecture

DOI10.1080/09720529.2013.867698MaRDI QIDQ2831830zbMATH OpenOpenAlexWikidataFDO

Authors S. M. Hegde, T. Srinivasa Murthy

Publication date 3 November 2016

Published in Journal of Discrete Mathematical Sciences \& Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2013.867698

zbMATH Keywords

\(k\)-cordial labeling\(t\)-harmonious labelingcombinatorial Nullstellensatzharmonious labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Other combinatorial number theory (11B75)

Recommendations

• The H_k-cordiality of trees
• A solution to an Ambarzumyan problem on trees
• scientific article; zbMATH DE number 822737
• A proof of the rooted tree alternative conjecture
• A tree version of Kőnig's theorem
• Generalization of some results on cordial graphs.
• On cordial labeling of hypertrees
• scientific article; zbMATH DE number 4187864
• A solution of Chartrand's problem on spanning trees
• scientific article; zbMATH DE number 1310930

Cites work

• A-cordial graphs
• Combinatorial Nullstellensatz
• Graph labeling and radio channel assignment
• Harmonious order of graphs
• On Additive Bases and Harmonious Graphs

Cited in

(1)

• All trees are six-cordial

This page was built for publication: A Partial Solution to Cordial Tree Conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2831830)