A Class Of Diameter Six Trees with Graceful Labeling
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 9, Issue 1
Abstract
Here we denote a diameter six tree by (a0, a1, a2, . . ., am, b1, b2, . . . , bn, c1, c2, . . . , cr) , where a0 is 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 a diameter four tree, each bj is the center of a star, and each ck is a pendant vertex. Here we give graceful labelings to some new classes of diameter six trees (a0,a1, a2, . . . , am, b1, b2, . . . , bn, c1, c2, . . . , cr) in which we nd diameter four trees consisting of four di erent combinations of odd, even, and pendant branches with the total number of branches odd. Here by a branch we mean a star, i.e. we call a star an odd branch if its center has an odd degree and an even branch if its center has an even degree..
Authors and Affiliations
Debdas Mishra , Amaresh Chandra Panda , Rajani Ballav Dash
Keywords
Related Articles
- EP ID EP157743
- DOI -
- Views 74
- Downloads 0
On Predicting the Next Term of a Sequence
When introducing sequences to students, the first skill we teach them is how to predict the next term of a sequence given the first few terms, usually the first three, four or five terms. In this note, we intend to show...
Total Outer Equitable Connected Domination of a Graph
Let G = (V, E) be a graph. A set D V (G) is equitable dominating set of G if v V – D a vertex u D such that uv E (G) and |d(u) – d(v)| 1. A set D V (G) is outer equitable dominating set if D is equitable dominati...
On the Dynamical Analysis of a New Model for Measles Infection
Epidemiologists and other health workers all over the world have noted that vaccination is an effective means of preventing most childhood diseases. In this study a compartmental mathematical model was formulated with th...
A Class Of Diameter Six Trees with Graceful Labeling
Here we denote a diameter six tree by (a0, a1, a2, . . ., am, b1, b2, . . . , bn, c1, c2, . . . , cr) , where a0 is the center of the tree; ai; i = 1, 2, . . . ,m, bj, j = 1, 2, . . . , n , and ck, k = 1, 2, . . . , r ar...
Neighborhood Properties of Ruscheweyh Type Analytic Functions
In this paper, we define the new subclasses S(m,n) (β,γ,δ),R(m,n) (β,γ,δ ; μ), S(m,n) (α,β,γ,δ) and R(m,n) (α,β,γ,δ ; μ) of T(n) using generalized Ruscheweyh derivative and certain properties of neighborhoods for functio...