摘要
主要讨论路P_n和P_m、路P_n和圈C_n的字典式乘积图的(d,1)-全标号,得出字典式乘积图P_noP_m、P_noC_m在一定约束条件下的(d, 1)-全数λ_d~T(G)的确切值.
This paper focuses on(d, l)-total labeling of the lexicographic products of path P_n and path P_m, path P_n and circle C_n, and gets the exact value of the(d, 1)-total number λ_d~T(G) of lexicographic product P_noP_m,P_noC_m under certain constraints.
引文
[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.