On the graceful numbering of spanning trees

DOI10.1016/0020-0190(75)90045-9MaRDI QIDQ1214751zbMATH OpenOpenAlexFDO

Authors I. Cahit, R. 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)

Cited in

(4)

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

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

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