• Title of article

    MODULAR CHROMATIC NUMBER OF CmPn

  • Author/Authors

    سامپاته كومار، ر. نويسنده Mathematics Section, Faculty of Engineering and Technology, Annamalai University, Annamalainagar-608 002, India Sampathkumar, R. , پاراماگورو ، ن. نويسنده Mathematics Wing, Directorate of Distance Education, Annamalai University, Annamalainagar-608 002, India Paramaguru, N.

  • Issue Information
    فصلنامه با شماره پیاپی 0 سال 2013
  • Pages
    26
  • From page
    47
  • To page
    72
  • Abstract
    A modular k-coloring, k  2; of a graph G is a coloring of the vertices of G with the elements in Zk having the property that for every two adjacent vertices of G; the sums of the colors of their neighbors are different in Zk: The minimum k for which G has a modular k-coloring is the modular chromatic number of G: Except for some special cases, modular chromatic number of CmPn is determined.
  • Journal title
    Transactions on Combinatorics
  • Serial Year
    2013
  • Journal title
    Transactions on Combinatorics
  • Record number

    842159

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=842159