Shannon Entropy of Ramsey Graphs with up to Six Vertices.

ABSTRACT

Shannon entropy quantifying bi-colored Ramsey complete graphs is introduced and calculated for complete graphs containing up to six vertices. Complete graphs in which vertices are connected with two types of links, labeled as α-links and ß-links, are considered. Shannon entropy is introduced according to the classical Shannon formula considering the fractions of monochromatic convex α-colored polygons with n α-sides or edges, and the fraction of monochromatic ß-colored convex polygons with m ß-sides in the given complete graph. The introduced Shannon entropy is insensitive to the exact shape of the polygons, but it is sensitive to the distribution of monochromatic polygons in a given complete graph. The introduced Shannon entropies Sα and Sß are interpreted as follows Sα is interpreted as an average uncertainty to find the green α-polygon in the given graph; Sß is, in turn, an average uncertainty to find the red ß-polygon in the same graph. The re-shaping of the Ramsey theorem in terms of the Shannon entropy is suggested. Generalization for multi-colored complete graphs is proposed. Various measures quantifying the Shannon entropy of the entire complete bi-colored graphs are suggested. Physical interpretations of the suggested Shannon entropies are discussed.