L(2,1)-Labeling for Subdivisions of Cycle Dominated Graphs
Journal: Bulletin of Computational Applied Mathematics (Bull CompAMa) (Vol.2, No. 2)Publication Date: 2014-12-31
Authors : Muthali Murugan;
Page : 7-19
Keywords : distance two labeling; transmitters; channel assignment; double fan;
Abstract
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of non-negative integers such that |f(x)-f(y)| >= 2 if x and y are adjacent and |f(x)-f(y)| >= 1 if x and y are at distance 2, for all x and y in V(G). The L(2,1)-labeling number lambda(G) of G is the smallest number k such that G has an L(2,1)-labeling f with max{f(v):v in V(G)}=k. In this paper, we construct L(2,1)-labeling of subdivisions of cycle dominated graphs like subdivided Double Fans, subdivided nCalpha with a common vertex and subdivided Books Bn and hence we find the λ-number of these graphs.
Other Latest Articles
- Uniform Stability and Boundedness of a Kind of Third Order Delay Differential Equations
- A Residual Approach for Balanced Truncation Model Reduction (BTMR) of Compartmental Systems
- At the Mid of Polarity: Rethinking Medium Farms as Solution to Vulnerability for Small-scale Farmers in Sub-Saharan Africa
- Spirituality and Search for Meaning in the Workplace
- Analyzing the Effect of Utilitarian and Hedonic Consumption on Fashion Leadership in the Apparel Sector
Last modified: 2018-08-05 10:33:12