On the graceful numbering of spanning trees

DOI10.1016/0020-0190(75)90045-9zbMath0298.68033OpenAlexW2069616944MaRDI QIDQ1214751

R. Cahit, I. Cahit

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90045-9

Mathematics Subject Classification ID

Trees (05C05) Algorithms in computer science (68W99)

Related Items (4)

On Additive Bases and Harmonious Graphs ⋮ Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path ⋮ Realization of graceful permutation by a shuffle-exchange network ⋮ An intermediate-value theorem for optimum tree valuation

Cites Work

• Unnamed Item

This page was built for publication: On the graceful numbering of spanning trees