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

Autor:	N A Dani, Devsi Bantva, Samir K. Vaidya, P L Vihol
Rok vydání:	2010
Předmět:	Combinatorics Discrete mathematics Graph labeling Graph power Edge-graceful labeling Wheel graph k-vertex-connected graph Bound graph Path graph Distance-regular graph Mathematics
Zdroj:	Journal of Mathematics Research. 2
ISSN:	1916-9809 1916-9795
DOI:	10.5539/jmr.v2n3p109
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e5d4a0f390527732f48861cb56eb97a0 https://doi.org/10.5539/jmr.v2n3p109 Zobrazit plný text záznamu