Cordial labeling of hypertrees

DOI10.1016/j.disc.2013.07.025zbMath1281.05118OpenAlexW2022807071MaRDI QIDQ393911

Zsolt Tuza, Sylwia Cichacz, Agnieszka Goerlich

Publication date: 24 January 2014

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

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

zbMATH Keywords

hypergraphhypertree\(k\)-cordial graphhypergraph labeling

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Klein cordial trees and odd cyclic cordial friendship graphs ⋮ \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs ⋮ All trees are six-cordial ⋮ On some graph-cordial abelian groups

Cites Work

• A-cordial graphs
• The computational complexity of cordial and equitable labelling
• On cordial and balanced labelings of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cordial labeling of hypertrees