The Center Coloring of a Graph
Abstract
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
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..