Harmonious order of graphs

DOI10.1016/J.DISC.2009.05.010zbMath1188.05138OpenAlexW2041241581MaRDI QIDQ1045099

Andrzej Żak

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.010

zbMATH Keywords

harmonious labelingharmonious orderharmonious tree conjecture

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Group sum chromatic number of graphs ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Note on the group edge irregularity strength of graphs ⋮ A Partial Solution to Cordial Tree Conjecture ⋮ Group irregularity strength of connected graphs

Cites Work

• On indexable graphs
• Some results on elegant graphs
• A dynamic survey of graph labeling
• Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
• Drawing a graph in a hypercube
• Cyclic difference sets
• Harmonious groups
• On sequential labelings of graphs
• On Additive Bases and Harmonious Graphs
• Arithmetic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Harmonious order of graphs