The Center Colorıng of a Graph
Abstract
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 ver
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942095818&doi=10.1080%2f09720529.2014.943473&partnerID=40&md5=43922b476ac45b8466b5ede09baa40d2https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10326
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..