On (p, 1)-total labelling of planar graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-015-9958-7
Abstract: A k-(p, 1)-total labelling of a graph G is a function f from $$V(G)\cup E(G)$$V(G)∪E(G) to the color set $$\{0, 1, \ldots , k\}$${0,1,…,k} such that $$|f(u)-f(v)|\ge 1$$|f(u)-f(v)|≥1 if $$uv\in E(G), |f(e_1)-f(e_2)|\ge 1$$uv∈E(G),|f(e1)-f(e2)|≥1 if $$e_1$$e1 and… read more here.
Keywords: labelling; total labelling; labelling planar; planar graphs ... See more keywords