Construction of an -labeled tree from a given set of -labeled trees

DOI10.1016/J.AKCEJ.2017.01.004zbMATH Open1372.05193OpenAlexW2588424454MaRDI QIDQ2409751FDOQ2409751

P. Ragukumar, G. Sethuraman

Publication date: 13 October 2017

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.01.004

Recommendations

• Alpha graphs with different pendent paths
• New \(\alpha\)-trees and graceful unions of \(\alpha\)-graphs and linear forests
• On the constructions of new families of graceful graphs.
• Folding trees gracefully
• Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees

zbMATH Keywords

graceful labelinggraceful treegraceful tree conjecture

Mathematics Subject Classification ID

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

Cites Work

• A dynamic survey of graph labeling
• The subdivision graph of a graceful tree is a graceful tree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• All trees of diameter five are graceful
• Two theorems on graceful trees
• All arbitrarily fixed generalized banana trees are graceful
• Operations of interlaced trees and graceful trees
• The gracefulness of a class of lobster trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Relaxed graceful labellings of trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trees having an even or quasi even degree sequence are graceful

Cited In (2)

• \(\alpha\)-labeling number of trees
• Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees

This page was built for publication: Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees

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