Operations of interlaced trees and graceful trees
From MaRDI portal
Publication:1806074
zbMath0932.05022MaRDI QIDQ1806074
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)
Related Items
A guide to the graph labeling zoo, On Super Edge-Magic Strength and Deficiency of Graphs, A class of diameter six trees exhibiting graceful labeling, Computer search for graceful labeling: a survey, Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees, On the unimodality of independence polynomials of some graphs, \(L(3, 2, 1)\)-labeling of banana trees, Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees, On the number of \(\alpha\)-labeled graphs, Counting graceful labelings of trees: a theoretical and empirical study, Almost all trees are almost graceful, Statistical identification of Markov chain on trees, Unnamed Item, Graceful labelling: state of the art, applications and future directions, All arbitrarily fixed generalized banana trees are graceful, Super edge-magic strength of fire crackers, banana trees and unicyclic graphs, Embedding an arbitrary tree in a graceful tree, Some graceful lobsters with all three types of branches incident on the vertices of the central path, Unnamed Item, The Achromatic Colouring Of Graphs, Some new graceful generalized classes of diameter six trees, Restrained geodetic domination in graphs, Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
