Some new graceful generalized classes of diameter six trees
<p>Here we denote a {\it diameter six tree} by $(c; a_{1}, a_{2}, \ldots, a_{m}; b_{1}, b_{2}, \ldots, b_{n}; c_{1}, c_{2}, \ldots, c_{r})$, where $c$ is the center of the tree; $a_{i}, i = 1, 2, \ldots, m$, $b_{j}, j = 1, 2, \ldots, n$, and $c_{k}, k = 1, 2, \ldots, r$ are the vertices o...
Main Authors: | Debdas Mishra, Sushant Kumar Rout, Puma Chandra Nayak |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/105 |
Similar Items
-
Expanding graceful trees
by: I Nengah Suparta, et al.
Published: (2020-10-01) -
Edge Even Graceful Labeling of Polar Grid Graphs
by: Salama Nagy Daoud
Published: (2019-01-01) -
Edge Even Graceful Labeling of Cylinder Grid Graph
by: Ahmed A. Elsonbaty, et al.
Published: (2019-04-01) -
Tight super-edge-graceful labelings of trees and their applications
by: Alex Collins, et al.
Published: (2015-11-01) -
Further results on super graceful labeling of graphs
by: Gee-Choon Lau, et al.
Published: (2016-08-01)