Lucky $\chi$-polynomial of graphs of order 5

Print   Print  

Authors :

Johan Kok

Author Address :

Independent Mathematics Researcher, South Africa & Department of Mathematics, CHRIST (Deemed to be a University), Bangalore, India.

Abstract :

The concept of Lucky $k$-polynomials was recently introduced for null and complete split graphs. This paper extends on the introductory work and presents Lucky $\chi$-polynomials ($k=\chi(G)$) for graphs of order 5. The methodical work done for graphs of order 5 serves mainly to set out the fundamental method to be used for all other classes of graphs. Finally, further problems for research related to this concept are presented.

Keywords :

Chromatic completion number, chromatic completion graph, chromatic completion edge, bad edge, Lucky $k$-polynomial, Lucky $\chi$-polynomial.

DOI :

10.26637/MJM0803/0006

Article Info :

Received : December 05, 2019; Accepted : March 17, 2020.