L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph

Lin, NF; Lu, DM; Wang, JH

Lin, NF (reprint author), Nantong Univ, Sch Sci, Nantong 226001, Jiangsu, Peoples R China.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018; 29 (1): 91

Abstract

Two edges e(1) and e(2) in a graph G are said to be adjacent if they have a vertex in common, and distance two apart if they are nonadjacent but both ......

Full Text Link