Family of Graceful Diameter Six Trees Generated by Component Moving Techniques
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 21, Issue 1
Abstract
Aims/ Objectives: To identify some new classes of graceful diameter six trees using component moving transformation techniques. Study Design: Literature Survey to our ndings. Place and Duration of Study: Department of Mathematics,C.V. Raman College Of Engineering,Bhubaneswar, India, between June 2014 and September 2016. Methodology: Component Moving Transformation. Results: Here a diameter six tree is denoted by (a0; a1; a2; : : : ; am; b1; b2; : : : ; bn; c1; c2; : : : ; cr) with a0 as the center of the tree, ai; i = 1; 2; : : : ;m, bj ; j = 1; 2; : : : ; n, and ck; k = 1; 2; : : : ; r are the vertices of the tree adjacent to a0; each ai is the center of some diameter four tree, each bj is the center of some star, and each ck is some pendant vertex. This article gives graceful labelings to a family of diameter six trees (a0; a1; a2; : : : ; am; b1; b2; : : : ; bn; c1; c2; : : : ; cr) with diameter four trees incident on ais possess an odd number of branches comprising of six di erent combinations of odd, even, and pendant branches. Here a star is called an odd branch if its center has an even degree, an even branch if its center has an odd degree, and a pendant branch if its center has degree one. Conclusions: Our article nds many new graceful diameter six trees by component moving techniques. However, the problem that all diameter six trees are graceful is still open and we conclude that one can not give graceful labelings to all diameter six trees by component moving techniques.
Authors and Affiliations
Debdas Mishra, Amaresh Chandra Panda
Keywords
Related Articles
- EP ID EP321831
- DOI 10.9734/BJMCS/2017/31074
- Views 106
- Downloads 0
The Impulse Interactive Cuts of Entropy Functional Measure on Trajectories of Markov Diffusion Process, Integrating in Information Path Functional, Encoding and Applications
The introduced entropy integral measure on random trajectories (EF) is defined by the process additive functional with functions drift and diffusion reducing this functional on trajectories to a regular integral function...
1P-ABC, a Simpli ed ABC Variant for Continuous Optimization Problems
In this paper a novel simpli ed and fast variant of the ABC algorithm is proposed, 1 Population ABC (1P-ABC), with the aim to increase the eciency of the ABC algorithm by using only one population of bees, the employed...
An Application of Reliability-analysis Techniques in Project Management
This paper handles a prominent problem of project management, namely that of project scheduling under uncertainty. The paper models this problem as a vector-weighted voting system and expresses the indicator variable for...
The Domination Number of Pm X Pn
A mixed graph GM(V, E, A) is a graph containing unoriented edges (set E) as well as oriented edges (set A), referred to as arcs. In this paper we calculate the domination number of the Cartesian product of a path Pm with...
Evaluation of Calinski-Harabasz Criterion as Fitness Measure for Genetic Algorithm Based Segmentation of Cervical Cell Nuclei
In this paper, the classi cation capability of Calinski-Harabasz criterion as an internal cluster validation measure has been evaluated for clustering-based region discrimination on cervical cells. In this approach, subr...