数学研究及应用2024,Vol.44Issue(2) :143-151.DOI:10.3770/j.issn:2095-2651.2024.02.001

Equitable Total Coloring of Fibonacci Graphs

Yong LI Chunling TONG Senyuan SU Yanan SU
数学研究及应用2024,Vol.44Issue(2) :143-151.DOI:10.3770/j.issn:2095-2651.2024.02.001

Equitable Total Coloring of Fibonacci Graphs

Yong LI 1Chunling TONG 2Senyuan SU 1Yanan SU1
扫码查看

作者信息

  • 1. School of Information Science and Electricity Engineering,Shandong Jiaotong University,Shandong 250357,P.R.China
  • 2. School of Information Science and Electricity Engineering,Shandong Jiaotong University,Shandong 250357,P.R.China;Department of Mathematics,Simon Fraser University,BC V5A 1S6,Canada
  • 折叠

Abstract

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.

Key words

Fibonacci graph/equitable total coloring/equitable total chromatic number

引用本文复制引用

基金项目

National Natural Science Foundation of China(62072292)

Natural Science Foundation of Shandong Province(ZR2020KF010)

出版年

2024
数学研究及应用
大连理工大学

数学研究及应用

CSCD
影响因子:0.094
ISSN:2095-2651
参考文献量24
段落导航相关论文