This paper focuses on (d, 1)-total labeling of the lexicographic products of path Pn and path Pm, path Pn and circle Cn, and gets the exact value of the (d, 1)-total number λdT (G) of lexicographic product Pn·Pm, Pn·Cm under certain constraints.
HAN Xin-yin
,
YAO Min
,
ZUO Lian-cui
,
ZHOU Wei-na
. (d,1)-total labeling of lexicographic products of some classes of graphs[J]. Journal of East China Normal University(Natural Science), 2019
, 2019(3)
: 35
-41
.
DOI: 10.3969/j.issn.1000-5641.2019.03.005
[1] 张焕, 左连翠. 关于图的(d,1)-全标号[J]. 山东大学学报(理学版), 2010, 45(12):1-4.
[2] SZUMNY W, WCH I, WCH A. On the existence and on the number of (k, l)-kernels in the lexicographic product of graphs[J]. Discrete Mathematics, 2008, 308(20):4616-4624.
[3] HAVET F, YU M L. (p, 1)-Total labelling of graphs[J]. Discrete Mathematics, 2008, 308(4):496-513.
[4] 左连翠, 周伟娜. 两类图的(d,1)-全标号[J]. 数学的实践与认识, 2017, 47(9):285-290.
[5] 周伟娜, 左连翠. 几类图的笛卡尔积图的(d,1)-全标号[J]. 山东大学学报(理学版), 2014, 49(4):24-28.