Operations of interlaced trees and graceful trees
From MaRDI portal
Recommendations
Cited in
(25)- Some new graceful generalized classes of diameter six trees
- Graceful labelling: state of the art, applications and future directions
- On the unimodality of independence polynomials of some graphs
- The achromatic colouring of graphs
- Statistical identification of Markov chain on trees
- Super edge-magic strength of fire crackers, banana trees and unicyclic graphs
- Some graceful lobsters with all three types of branches incident on the vertices of the central path
- On the number of \(\alpha\)-labeled graphs
- Restrained geodetic domination in graphs
- Counting graceful labelings of trees: a theoretical and empirical study
- All arbitrarily fixed generalized banana trees are graceful
- Embedding an arbitrary tree in a graceful tree
- Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
- Almost all trees are almost graceful
- Expanding graceful trees
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
- The joint sum of graceful trees
- \(L(3, 2, 1)\)-labeling of banana trees
- A guide to the graph labeling zoo
- On Super Edge-Magic Strength and Deficiency of Graphs
- scientific article; zbMATH DE number 7489191 (Why is no real title available?)
- scientific article; zbMATH DE number 2230306 (Why is no real title available?)
- A class of diameter six trees exhibiting graceful labeling
- Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
- Computer search for graceful labeling: a survey
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)
