3-MODULO CORDIAL GRAPHS ON CYCLE RELATED GRAPHS 3-MODULO CORDIAL GRAPHS ON CYCLE RELATED GRAPHS

• Author(s):

  S.S.Sabarina Subi | A.Nagarajan

• Keywords:

  3-modulo Cordial Graph, 3-modulo Cordial Labeling.

• Abstract:

  Let G = (V,E ) Be A Simple Graph With P Vertices And Q Edges. G Is Said To Have 3 –modulo Cordial Labeling If There Is A Injective Map Such That For Every Edge , The Induced Labeling Is Defined As F*(uv) = 1 If F(u)+f(v) 0 (mod 3) And 0 Elsewhere

---

Other Details

• Paper id:

  IJSARTV4I221044

• Published in:

  Volume: 4 Issue: 2 February 2018

• Publication Date:

  2018-02-23

Download Article