标题:On (p, 1)-total labelling of planar graphs
作者:Sun, Lin; Wu, Jian-Liang
作者机构:[Sun, Lin; Wu, Jian-Liang] Shandong Univ, Sch Math, Jinan 250100, Peoples R China.; [Sun, Lin] Changji Coll, Dept Math, Changji 831100, Peoples R Ch 更多
通讯作者:Wu, JianLiang
通讯作者地址:[Wu, JL]Shandong Univ, Sch Math, Jinan 250100, Peoples R China.
来源:JOURNAL OF COMBINATORIAL OPTIMIZATION
出版年:2017
卷:33
期:1
页码:317-325
DOI:10.1007/s10878-015-9958-7
关键词:(p, 1)-total labelling; Minimal counterexample; Discharging method
摘要:Ak-(p, 1)-total labelling of a graph G is a function f from V(G)boolean OR E(G) to the color set {0, 1,..., k} such that vertical bar f (u) - f (v)vertical bar >= 1 if uv is an element of E(G), vertical bar f (e(1)) - f (e(2))vertical bar >= 1 if e(1) and e(2) are two adjacent edges in G and vertical bar f (u) - f (e)vertical bar >= p if the vertex u is incident with the edge e. The minimum k such that G has a k-(p, 1)-total labelling, denoted by lambda(T)(p) (G), is called the (p, 1)-total labelling number of G. In this paper, we prove that, for any planar graph G with maximum degree Delta >= 4p + 4 and p >= 2, lambda(T)(p) (G) <= Delta + 2p - 2.
收录类别:EI;SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84944699671&doi=10.1007%2fs10878-015-9958-7&partnerID=40&md5=e3f5a49c51ceb797e7efcb68d010cd9a
TOP