On irregular colorings of double wheel graph families
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics · 11.04.2018 · 68 (1) · 944-949
DOI: 10.31801/cfsuasmas.490001 ↗Kurz gefasst
Fachartikel in der Zeitschrift Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, online erschienen am 11.04.2018. Verfasst von A. Rohini und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 8 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Rohini, A., & Venkatachalam, M. (2018). On irregular colorings of double wheel graph families. Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 68(1), 944-949. https://doi.org/10.31801/cfsuasmas.490001
Vancouver
Rohini A, Venkatachalam M. On irregular colorings of double wheel graph families. Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics. 2018;68(1):944-949. doi:10.31801/cfsuasmas.490001
BibTeX
@article{Rohini2018,
author = {Rohini, A. and Venkatachalam, M.},
title = {On irregular colorings of double wheel graph families},
journal = {Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics},
year = {2018},
volume = {68},
number = {1},
pages = {944--949},
doi = {10.31801/cfsuasmas.490001}
}
EUVIMED