Operations of interlaced trees and graceful trees

MaRDI QIDQ1806074zbMATH OpenFDO

Authors Wen-Chin Chen, Hsueh-I Lu, Yeong-Nan Yeh

Publication date 1 November 1999

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

graceful treesinterlaced treeslabelingRingel-Kotzig conjecture

Mathematics Subject Classification ID

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

Recommendations

• A survey of graceful trees
• A substitution theorem for graceful trees and its applications
• Generation of graceful trees from arbitrary trees
• On Graceful Labelings of Trees
• Expanding graceful trees

Cited in

(28)

• Some graceful lobsters with all three types of branches incident on the vertices of the central path
• The joint sum of graceful trees
• A guide to the graph labeling zoo
• On the number of \(\alpha\)-labeled graphs
• Statistical identification of Markov chain on trees
• Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
• Super edge-magic strength of fire crackers, banana trees and unicyclic graphs
• \(L(3, 2, 1)\)-labeling of banana trees
• The achromatic colouring of graphs
• Expanding graceful trees
• Some new graceful generalized classes of diameter six trees
• scientific article; zbMATH DE number 7489191 (Why is no real title available?)
• A class of diameter six trees exhibiting graceful labeling
• Computer search for graceful labeling: a survey
• Almost all trees are almost graceful
• On Super Edge-Magic Strength and Deficiency of Graphs
• scientific article; zbMATH DE number 2230306 (Why is no real title available?)
• Restrained geodetic domination in graphs
• On the unimodality of independence polynomials of some graphs
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
• Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing
• Embedding of extended Sierpinski networks \(S^{++}(k, m)\) into certain trees
• Graceful labelling: state of the art, applications and future directions
• All arbitrarily fixed generalized banana trees are graceful
• Embedding an arbitrary tree in a graceful tree
• Power dominator coloring of line graph of certain graphs
• Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
• Counting graceful labelings of trees: a theoretical and empirical study

This page was built for publication: Operations of interlaced trees and graceful trees

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