JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2024, Vol. 59 ›› Issue (2): 38-46.doi: 10.6040/j.issn.1671-9352.0.2022.591
CAO Jing, CHEN Xiangen*
CLC Number:
[1] BUEEIS A C, SCHELP R H. Vertex-distinguishing proper edge-coloring[J]. Journal Graph Theory, 1997, 26(2):73-82. [2] CERNY J, HORNAK M, SOTAK R. Observability of a graph[J]. Mathematica Slovaca, 1996, 46(1):21-31. [3] BALISTER P N, RIORDAN O M, SCHELP R H. Vertex-distinguishing edge colorings of graphs[J]. Journal of Graph Theory, 2003, 42(2):95- 109. [4] 辛小青,陈祥恩. m个点不交的C4的并的点可区别全染色[J]. 山东大学学报(理学版), 2010, 45(10):35-39,44. XIN Xiaoqing, CHEN Xiangen. Vertex distinguishing total chromatic number of mC4[J]. Journal of Shandong University(Natural Science), 2010, 45(10):35-39,44. [5] 文飞,王治文,王鸿杰,等.若干补倍图的点可区别全染色[J]. 山东大学学报(理学版), 2011, 46(2):45-50. WEN Fei, WANG Zhiwen, WANG Hongjie, et al. Vertex-distinguishing total coloring of some complement double graph[J]. Journal of Shandong University(Natural Science), 2011, 46(2):45-50. [6] ZHANG Z F, QIU P X, XV B G, et al. Vertex-distinguishing total coloring of graphs[J]. ARS Combinatoria, 2008, 87:33-45. [7] 张辉,陈祥恩,王治文.轮和扇三类联图的邻点被扩展和可区别全染色[J]. 中山大学学报(自然科学版), 2019, 58(3):86-93. ZHANG Hui, CHEN Xiangen, WANG Zhiwen. The neighbor expanded sum distinguishing total colorings of three types of join graphs of wheel and fan[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2019, 58(3):86-93. [8] CHEN X E, ZU Y, XU J. Vertex-distinguishing E-total colorings of graphs[J]. Arabian Journal for Scienceand Engineering, 2011, 36(8):1485- 1500. [9] 杨澜,陈祥恩.完全二部图K(8,n)(472<n<980)的点可区别E-全染色[J]. 厦门大学学报(自然科学版), 2020, 59(4):507-511. YANG Lan, CHEN Xiangen. Vertex-distinguishing E-total coloring of complete bipartite graph K(8,n)(472 [10] 陈祥恩,杨伟光.完全二部图K(9,n)(93<n<216)的点可区别E-全染色[J]. 华东师范大学学报(自然科学版), 2020(6):24-29. CHEN Xiangen, YANG Weiguang. Vertex-distinguishing E-total coloring of complete bipartite graph K(9,n) with 93<n<216[J]. Journal of East China Normal University(Natural Science), 2020(6):24-29. [11] 包丽娅,陈祥恩,王治文.完全二部图K(10,n)(215<n<466)的点可区别E-全染色[J]. 浙江大学学报(理学版), 2020, 47(1):60-66. BAO Liya, CHEN Xiangen, WANG Zhiwen. Vertex-distinguishing E-total coloring of complete bipartite graph K(10,n) with 215<n< 466[J]. Journal of Zhejiang University(Science Edition), 2020, 47(1):60-66. |
[1] | . Vertex-distinguishing IE-total coloring and general-total coloring of K1,3,p and K1,4,p [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(8): 53-60. |
[2] | . Vertex-distinguishing E-total coloring of complete bipartite graph K10,n with 10≤n≤90 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 23-30. |
[3] | . Gelfand-Krillov dimension of quantized enveloping algebra Uq(An) [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(10): 12-17. |
[4] | LI Shi-ling, CHEN Xiang-en, WANG Zhi-wen. Vertex-Distinguishing E-Total coloring of complete bipartite graph K3,n with n≥18 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(4): 68-71. |
[5] | TIAN Xiao-huan, CHEN Chun-rong. Gap functions and error bounds for Ky Fan quasi-inequalities [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(11): 123-126. |
[6] | LIU Xin-sheng, DENG Wei-dong, WANG Zhi-qiang. Several conclusions of adjacent vertex distinguishing E-total coloring of the cartesian product graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(02): 5-8. |
[7] | DU Yingling1, SUN Zongbao2. F-rough law separation and the operation-recognition of FCU [J]. J4, 2011, 46(6): 110-114. |
[8] | WANG Guo-xing. Vertex distinguishing IE-total chromatic numbers of mC3 [J]. J4, 2011, 46(2): 57-61. |
|