全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

Center Coloring in Graph Operations

DOI: 10.4236/oalib.1107318, PP. 1-6

Subject Areas: Mathematics

Keywords: Graph, Graph Coloring, Graph Operations

Full-Text   Cite this paper   Add to My Lib

Abstract

Center coloring Cc(G) is a kind of coloring that is to color the vertices of a graph G is such a way that if vertices have different distances from the center then they must receive different colors. Two adjacent vertices can receive the same color. In this paper we observed the behavior of the center coloring under several graph operations such as adding, removing, union, join, sequential join, Cartesian product, corona product of graphs and we get some bounds for center coloring number in these graph operations.

Cite this paper

Yorgancioglu, Z. O. and Dündar, P. (2021). Center Coloring in Graph Operations. Open Access Library Journal, 8, e7318. doi: http://dx.doi.org/10.4236/oalib.1107318.

References

[1]  Yorgancioglu, Z., Dundar, P. and Berberler, M. E. (2015) The Center Coloring of a Graph. Journal of Discrete Mathematical Sciences, 18, 531-540.
[2]  Buckley, F. and Harary, F. (1990) Distance in Graph. Addison-Wesley, California, 335.
[3]  Chartrand, G. and Lesniak, L. (2005) Graphs & Digraphs. Chapman & Hall/CRC Press, USA, 386.
[4]  Gutman, I. (1998) Distance of Thorny Graphs. Publications de I’Institut Mathematique, 63, 31-36.
[5]  Dündar, P. (2004) The Median and Distance Measures of Celf-Centered Graphs. Journal of Engineering and Science, Sigma, 4, 229-233.

Full-Text


comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413