SOME RESULTS OF LABELING ON BROOM GRAPH
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2015, Vol 9, Issue 9
Abstract
A Broom Graph Bn,d is a graph of n vertices, which have a path P with d vertices and (n-d) pendant vertices, all of these being adjacent to either the origin u or the terminus v of the path P. Here we consider various labeling on Broom graph such as Cordial labeling, Antimagic labeling and b-coloring.
Authors and Affiliations
Anita Pal, Poulomi Ghosh
Keywords
Related Articles
- EP ID EP651520
- DOI 10.24297/jam.v9i9.2239
- Views 130
- Downloads 0
THE PERIOD OF 2-STEP AND 3-STEP SEQUENCES IN DIRECT PRODUCT OF MONOIDS
Let M and N be two monoids consisting of idempotent elements. By the help of the presentation which defines Mx N, the period of 2-step sequences and 3-step sequences in MxN is given.
Subdifferential calculus for invariant linear ordered vector space-valued operators and applications
We give a direct proof of sandwich-type theorems for linear invariant partially ordered vector space operators in the setting of convexity. As consequences, we deduce equivalence results between sandwich, Hahn-Banach, se...
The Bessel-type Wavelet Convolution Product
In this paper the convolution product associated with the Bessel-type Wavelet transformation is investigated.Further,certain norm inequalities for the convolution product are established.
Further Acceleration of the Simpson Method for Solving Nonlinear Equations
There are two aims of this paper, firstly, we present an improvement of the classical Simpson third-order method for finding zeros a nonlinear equation and secondly, we introduce a new formula for approximating second-or...
Congruences on *-Simple Type A I-Semigroups
This paper obtains a characterisation of the congruences on *-simple type A I-semigroups. The *-locally idempotent-separating congruences, strictly *-locally idempotent-separating congruences and minimum cancellative mon...