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 104
- Downloads 0
The Cycled Shortest Path Problem: A New Perspective, And Sensitivity Analysis
Several algorithms, including the Floyd-Warshall algorithm, have been developed to calculate the shortest path between every pair of vertices in a graph (network) with cycles. This study proposes an exact algorithm, the...
Super Convergence Method for Solution of Higher Order Boundary Value Problems
A new O(h10) super convergence method based on B-spline of degree eight has been developed for solution of higher order boundary value problems. Our presented collocation method leads to optimal approximation, we descri...
Oscillation of Second Order Difference Equation with a Superlinear Neutral Term
This paper deals with oscillation of certain class of second order difference equation with a superlinear neutral term. Using comparison method some new oscillation criteria are obtained. Examples are included to illustr...
Viscosity Approximation Methods in Reflexive Banach Spaces with a Sequence of Contractions
The aim of this paper is to study viscosity approximation methods in re exive Banach spaces. Let E be a re exive Banach space which admits a weakly sequentially continuous duality mapping j : E → E , C a nonempty close...
A New Spectral-Collocation Method Using Legendre Multi-wavelets for Solving of Nonlinear Fractional Differential Equations
In this paper, a novel spectral collocation method using Legendre multi-wavelets as the basis functions is presented to obtain the numerical solution of nonlinear fractional differential equations. The fractional derivat...