Zeynep Ors YorganciogluPinar DündarMurat Erşen Berberler2025-10-062015097205290972-05292169-006510.1080/09720529.2014.943473https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942095818&doi=10.1080%2F09720529.2014.943473&partnerID=40&md5=0aea5015530b13e51c8609e4c9827a21https://gcris.yasar.edu.tr/handle/123456789/9883Abstract: For a nontrivial connected graph G center coloring is a kind of coloring that is to color the vertices of a graph G is such a way that if vertices have different distance from the center then they must receive different colors. Two adjacent vertices can receive the same color. The number of colors required of such a coloring is called center coloring number C<inf>c</inf> (G) of G. [7] This coloring can be applied to hierarchy problems to find the number of structures people criteria and comparisons etc. Moreover it can be applied to earthquake motion problems to find the number of settlements that are affected by an earthquake. The center coloring number of some well-known classes of graphs are determined and several bounds are established for the center coloring number of a graph in terms of other graphical parameters. © 2023 Elsevier B.V. All rights reserved.EnglishCenter Coloring, Coloring, Diameter, Color, Earthquakes, Graph Theory, Adjacent Vertices, Center Coloring, Connected Graph, Diameter, Earthquake Motion, Graph G, Hierarchy Problem, Motion Problems, ColoringColor, Earthquakes, Graph theory, Adjacent vertices, Center coloring, Connected graph, Diameter, Earthquake motion, Graph G, Hierarchy problem, Motion problems, ColoringArticle