A Class Of Diameter Six Graceful Trees
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2014, Vol 9, Issue 5
Abstract
In this paper we give graceful labelings to diameter six trees( a1, a2, . . . , am; b1, b2, . . . , bn; c1, c2, . . . , csatisfying the following property: m + n is odd, degree of each neighbour of a0 is even, and the centers of the branches incident on the center ai of diameter four trees are either all odd branches or all even branches.
Authors and Affiliations
AMARESH CHANDRA PANDA, Debdas Mishra
ORACLE INEQUALITIES FOR LASSO AND DANTZIG SELECTOR IN HIGH-DIMENSIONAL LINEAR REGRESSION
During the last few years, a great deal attention has been focused on lasso and Dantzig selector in high-dimensional linear regression under a sparsity scenario, that is, when the number of variables can be much larger t...
Bounded solution of Cauchy type singular integral equation of the first kind using differential transform method
In this paper, an efficient approximate solution for solving the Cauchy type singular integral equation of the first kind is presented. Bounded solution of the Cauchy type singular Integral equation is discusse...
Information Measures and some Distribution Approximations.
The Fisher and Kullback- Liebler information measures were calculated from the approximation of a binomial distribution by both the Poisson and the normal distributions and are applied to the approximation of a Poisson d...
Edge Jump Distance Graphs
The concept of edge jump between graphs and distance between graphs was introduced by Gary Chartrand et al. in [5]. A graph H is obtained from a graph G by an edge jump if G contains four distinct vertices u, v, w, and x...
Continued Fraction Solution of the GeneralizedBarker Equation of Parabolic Orbital Motion
In this present paper, simple and accurate algorithm was established for the solution ofgeneralized Barker's equation of parabolic orbital motion.The algorithm based on the continued fractionexpansion theory. Numerical a...