✦ LIBER ✦

Vertex-magic labeling of trees and forests

✍ Scribed by I.D. Gray; J. MacDougall; J.P. McSorley; W.D. Wallis

Book ID: 108315784
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 172 KB
Volume: 261
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00475-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Anti-magic labeling of trees

✍ Liang, Yu-Chang; Wong, Tsai-Lien; Zhu, Xuding 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 394 KB

-super vertex magic labelings of graphs

✍ G. Marimuthu; M. Balakrishnan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 721 KB

Vertex‐Magic Total Labelings of Regular

Vertex‐Magic Total Labelings of Regular Graphs

✍ Gray, Ian D. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 136 KB

Vertex-magic labeling of regular graphs:

Vertex-magic labeling of regular graphs: Disjoint unions and assemblages

✍ I.D. Gray; J.A. MacDougall 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 540 KB

Forests of label-increasing trees

✍ John Riordan 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

Label-increasing trees are fully labeled rooted trees with the restriction that the labels are in increasing order on every path from the root; the best known example is the binary case-no tree with more than two branches at the root, or internal vertices of degree greater than threeextensively exam

Solution of the conjecture: If , , then

Solution of the conjecture: If , , then has a super vertex-magic total labeling

✍ J. Gómez 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 180 KB