Université de Mons
Cahiers du GERAD
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they indu...référence BibTeX
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
We study the average number
\(A(G)\) of colors in the non-equivalent colorings of a graph
\(G\). We show some general properties of this graph invariant ...
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pending vertices
The eccentric connectivity
index of a connected graph
\(G\) is the sum over all vertices
\(v\) of the product
\(d_G(v)\) is ...