Lucky \(\chi\)-polynomial of graphs of order 5

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 \(chi\)-polynomial , Lucky \(k\)-polynomial

Mathematics Subject Classification:

Mathematics
  • Johan Kok Independent Mathematics Researcher, South Africa & Department of Mathematics, CHRIST (Deemed to be a University), Bangalore, India.
  • Pages: 767-764
  • Date Published: 01-07-2020
  • Vol. 8 No. 03 (2020): Malaya Journal of Matematik (MJM)

J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. Macmillan Press, London, 2017.

F. Harary. Graph Theory. Addison-Wesley, Reading MA, 1969.

J. Kok. Chromatic completion number. Communicated.

J. Kok. Stability in respect of chromatic completion of graphs. Communicated.

J. Kok. Lucky k-polynomials for null and complete split graphs. Communicated.

E.G. Mphako-Banda. An introduction to the k-defect polynomials. Quaestiones Mathematicae., 1-10, 2018.

B. West. Introduction to Graph Theory. Prentice-Hall, Upper Saddle River, 1996.

  • NA

Metrics

Metrics Loading ...

Published

01-07-2020

How to Cite

Johan Kok. “Lucky \(\chi\)-Polynomial of Graphs of Order 5”. Malaya Journal of Matematik, vol. 8, no. 03, July 2020, pp. 767-4, doi:10.26637/MJM0803/0006.