STM Journals Peer-reviewed research from Consortium e-Learning Network

Research & Reviews: Discrete Mathematical Structures

Lucas Divisor Cordial labeling of various graphs

  1. Shares John
  2. Suresh Sorathia
  3. Amit Rokad

Abstract

In this we found six new graphs families satisfying the condition of Lucas divisor cordial labeling. We prove that Shadow of star graph is Lucas divisor cordial. We prove that Degree splitting of star graph is Lucas divisor cordial. We prove that Jewel graph Jn is Lucas divisor cordial. And we prove that Globe graph Gln is Lucas divisor cordial. Further we prove that K1, 1, n is Lucas divisor cordial. And we also prove that Degree splitting of path graph is Lucas divisor cordial labeling.

Keywords

Support