All trees are six-cordial

DOI10.5614/ejgta.2017.5.1.3zbMath1467.05220arXiv1604.02105OpenAlexW3100454141MaRDI QIDQ5006597

Keith Driscoll, Michelle Nguyen, Elliot Krop

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02105

zbMATH Keywords

treesgraph labelingcordial\(k\)-cordial

Mathematics Subject Classification ID

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

Related Items (4)

Path-cordial abelian groups ⋮ Klein cordial trees and odd cyclic cordial friendship graphs ⋮ \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs ⋮ The second least eigenvalue of the signless Laplacian of the complements of trees

Cites Work

• Cordial labeling of hypertrees
• A-cordial graphs
• On sequential labelings of graphs
• On Additive Bases and Harmonious Graphs
• Generalized graph cordiality
• Unnamed Item
• Unnamed Item

This page was built for publication: All trees are six-cordial