Equitable Total Coloring of Fibonacci Graphs

作     者：Yong LI Chunling TONG Senyuan SU Yanan SU Yong LI;Chunling TONG;Senyuan SU;Yanan SU

作者机构：School of Information Science and Electricity Engineering Shandong Jiaotong University Department of Mathematics Simon Fraser University 

出 版 物：《Journal of Mathematical Research with Applications》 (数学研究及应用(英文))

年 卷 期：2024年第44卷第2期

页      面：143-151页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

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

主　　题：Fibonacci graph equitable total coloring equitable total chromatic number 

摘      要：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?,nfor ? = 3, 4, 5 and propose a conjecture on that for ? = 6.