Heuristic method to determine lucky k-polynomials for k-colorable graphs

Abstract

The existence of edges is a huge challenge with regards to determining lucky k-polynomials of simple connected graphs in general. In this paper the lucky 3-polynomials of path and cycle graphs of order, 3 ≤ n ≤ 8 are presented as the basis for the heuristic method to determine the lucky k-polynomials for k-colorable graphs. The difficulty of adjacency with graphs is illustrated through these elementary graph structures. The results are also illustratively compared with the results for null graphs (edgeless graphs). The paper could serve as a basis for finding recurrence results through innovative methodology.

Keywords

• chromatic completion
• perfect lucky 3-coloring
• lucky 3-polynomial
• 05c15
• 05c38
• 05c75
• 05c85