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 143
- Downloads 0
The Angle Trisection Solution (A Compass-Straightedge (Ruler) Construction)
This paper is devoted to exposition of a provable classical solution for the ancient Greeks classical geometric problem of angle trisection [3]. (Pierre Laurent Wantzel, 1837),presented an algebraic proof based on ideas...
Fuzzy decision making in Business intelligence in the context of Gilgit-Baltistan
The main purpose of this paper is to investigate and implement fuzzy decision based on unequal objectives and minimization of regret for the decision making in the business intelligence and to compare the weight of produ...
COMMON FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPPINGS IN COMPLEX VALUED b-METRIC SPACES
In this paper, we prove a common xed point theorem for weakly compatible mappings in complex valued b-metric space and also improve the condition of contraction of the results of M. Kumar et al.[7]. Further, we prove com...
An infinite plate with a curvilinear hole having three poles with complex parameters
This paper covered the study of the boundary value problem for isotropic homogeneous perforated infinite elastic media. For this, we considered the problem of a thin infinite plate of specific thickness with a curvilinea...
Modeling Vanilla Option prices: A simulation study by an implicit method
Option contracts can be valued by using the Black-Scholes equation, a partial differential equation with initial conditions. An exact solution for European style options is known. The computation time and the error need...