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

S K Vaidya, P L Vihol, N A Dani, D D Bantva


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.

Full Text:


DOI: https://doi.org/10.5539/jmr.v2n3p109

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.