Equitable Total Coloring of Fibonacci Graphs  

作　　者：Yong LI Chunling TONG Senyuan SU Yanan SU 

机构地区：[1]School of Information Science and Electricity Engineering,Shandong Jiaotong University,Shandong 250357,P.R.China [2]Department of Mathematics,Simon Fraser University,BC V 5A 1S6,Canada

出　　处：《Journal of Mathematical Research with Applications》2024年第2期143-151,共9页数学研究及应用（英文版）

基　　金：Supported by the National Natural Science Foundation of China(Grant No.62072292);the Natural Science Foundation of Shandong Province(Grant No.ZR2020KF010).

摘　　要：The equitable total coloring of a graph G is a total coloring such that the numbers of elements in any two colors differ by at most one.The smallest number of colors needed for an equitable total coloring is called the equitable total chromatic number.This paper contributes to the equitable total coloring of Fibonacci graphs F_(∆,n).We determine the equitable total chromatic numbers of F_(∆,n) for∆=3,4,5 and propose a conjecture on that for∆>=6.

关 键 词：Fibonacci graph equitable total coloring equitable total chromatic number 

分 类 号：O157.5[理学—数学]