Research on the Sum of Chromatic Coefficients
Nianzu Liu · Or Transactions · 2003
In this paper, it is proved that the sum of chromatic coefficients of any simple graphs must be The expressions of the absolute sum of chromatic coefficients of some families of graphs, such as trees, 2-trees, cycles, wheels and complete graphs, are given. Finally, it is proved that the absolute sum of chromatic coefficients of any simple connected graphs varies directly as eand must satisfy