The mean chromatic number of a graph is defined. This is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. In this note, we analyse the asymptotic behaviour of the mean chromatic number for the paths and even cycles, using generating function techniques.
机构:
Shandong Univ, Sch Math, Jinan 250100, Peoples R China
Univ Paris Saclay, Lab Interdisciplinaire Sci Numer, Gif Sur Yvette, FranceShandong Univ, Sch Math, Jinan 250100, Peoples R China
Zhou, Wenling
Li, Binlong
论文数: 0引用数: 0
h-index: 0
机构:
Northwestern Polytech Univ, Sch Math & Stat, Xian 710072, Peoples R ChinaShandong Univ, Sch Math, Jinan 250100, Peoples R China
机构:
Kokushikan Univ, Fac Phys Educ, Dept Sport & Phys Educ, 7-3-1 Nagayama, Tokyo 2068515, JapanKokushikan Univ, Fac Phys Educ, Dept Sport & Phys Educ, 7-3-1 Nagayama, Tokyo 2068515, Japan
Ichishima, Rikio
Muntaner-Batle, Francesc Antoni
论文数: 0引用数: 0
h-index: 0
机构:
Univ Newcastle, Fac Engn & Built Environm, Sch Elect Engn & Comp Sci, Graph Theory & Applicat Res Grp, Callaghan, NSW 2308, AustraliaKokushikan Univ, Fac Phys Educ, Dept Sport & Phys Educ, 7-3-1 Nagayama, Tokyo 2068515, Japan
Muntaner-Batle, Francesc Antoni
Takahashi, Yukio
论文数: 0引用数: 0
h-index: 0
机构:
Kokushikan Univ, Fac Elect & Informat, Dept Sci & Engn, 4-28-1 Setagaya Ku, Tokyo 1548515, JapanKokushikan Univ, Fac Phys Educ, Dept Sport & Phys Educ, 7-3-1 Nagayama, Tokyo 2068515, Japan