On irregular colorings of double wheel graph families

A. Rohini; M. Venkatachalam

doi:https://doi.org/10.31801/cfsuasmas.490001

Makale detayları

On irregular colorings of double wheel graph families

Yazarlar:

A. Rohini | M. Venkatachalam

Yayıncı:

Ankara University

Dergi:

Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 2019 Vol.68 Issue 1, pp.944-949

Belge Tipi:

Makale

Yayın Tarihi:

1/2019

Belge Dili:

İngilizce

Document ID (Org No.):

2000909530

Sıklık:

Üç Aylık

eISSN:

2618-6470

pISSN:

1303-5991

DOI:

https://doi.org/10.31801/cfsuasmas.490001

Ö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.

Makale detayları

On irregular colorings of double wheel graph families

Yazarlar: A. Rohini | M. Venkatachalam

Yayıncı: Ankara University

Dergi: Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 2019 Vol.68 Issue 1, pp.944-949

Belge Tipi: Makale

Yayın Tarihi: 1/2019

Belge Dili: İngilizce

Document ID (Org No.): 2000909530

Sıklık: Üç Aylık

eISSN: 2618-6470

pISSN: 1303-5991

DOI: https://doi.org/10.31801/cfsuasmas.490001

Sayı

Yazarlar:

A. Rohini | M. Venkatachalam

Yayıncı:

Ankara University

Dergi:

Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics 2019 Vol.68 Issue 1, pp.944-949

Belge Tipi:

Makale

Yayın Tarihi:

1/2019

Belge Dili:

İngilizce

Document ID (Org No.):

2000909530

Sıklık:

Üç Aylık

eISSN:

2618-6470

pISSN:

1303-5991

DOI:

https://doi.org/10.31801/cfsuasmas.490001