ON IRREGULAR COLORINGS OF DOUBLE WHEEL GRAPH FAMILIES


Creative Commons License

Rohini A., Venkatachalam M.

COMMUNICATIONS FACULTY OF SCIENCES UNIVERSITY OF ANKARA-SERIES A1 MATHEMATICS AND STATISTICS, cilt.68, sa.1, ss.944-949, 2019 (ESCI İndekslerine Giren Dergi) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 68 Konu: 1
  • Basım Tarihi: 2019
  • Doi Numarası: 10.31801/cfsuasmas.000000
  • Dergi Adı: COMMUNICATIONS FACULTY OF SCIENCES UNIVERSITY OF ANKARA-SERIES A1 MATHEMATICS AND STATISTICS
  • Sayfa Sayıları: ss.944-949

Özet

An assignment of colors to the vertices of a graph, so that no two adjacent vertices get the same color is called a proper coloring. An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbours. In this paper, we investigate the irregular chromatic number for the middle graph, total graph, central graph and line graph of double wheel graph.