L(2,1)-Labeling In The Context Of Some Graph Operations | Zendy

S. K. Vaidya | Zendy; P L Vihol | Zendy; N A Dani | Zendy; Devsi Bantva | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

L(2,1)-Labeling In The Context Of Some Graph Operations

Author(s) -

S. K. Vaidya,

P L Vihol,

N A Dani,

Devsi Bantva

Publication year - 2010

Publication title -

journal of mathematics research

Language(s) - English

Resource type - Journals

eISSN - 1916-9809

pISSN - 1916-9795

DOI - 10.5539/jmr.v2n3p109

Subject(s) - mathematics , combinatorics , edge graceful labeling , graph labeling , wheel graph , graph , path graph , context (archaeology) , connectivity , discrete mathematics , graph power , line graph , biology , paleontology

Let G = (V; E) be a connected graph. For integers j ? k, L( j; k)-labeling of a graph G is an integer labeling of the vertices in V such that adjacent vertices receive integers which differ by at least j and vertices which are at distance two apart receive labels which differ by at least k. In this paper we discuss L(2; 1) labeling (or distance two labeling) in the context of some graph operations.