On the Star Coloring of Graphs Formed From the Cartesian Product of Some Simple Graphs


Abstract views: 9 / PDF downloads: 11

Authors

  • L. Jethruth Emelda Mary Department of Mathematics, St. Joseph’s College of Arts & Science, Manjakuppam, Cuddalore (Tamil Nadu), India
  • A. Lydia Mary Juliette Rayen Department of Mathematics, St. Joseph’s College of Arts & Science, Manjakuppam, Cuddalore (Tamil Nadu), India

Keywords:

Proper coloring, Chromatic number, Star coloring, Star chromatic number, Cartesian product of graphs, Prism graph, Barbell graph, Fan graph, Windmill graph, Lollipop graph

Abstract

Let $G= (V, E)$ be an undirected simple graph. The star chromatic number of a graph G is the least number of colors needed to color the path on four vertices with three distinct colors. The purpose of this paper is to study the star coloring of some graph families formed from the Cartesian product of some simple graphs.

Downloads

Published

01-12-2016

How to Cite

L. Jethruth Emelda Mary, & A. Lydia Mary Juliette Rayen. (2016). On the Star Coloring of Graphs Formed From the Cartesian Product of Some Simple Graphs. International Journal of Mathematics And Its Applications, 4(4 (Special Issue), 115–122. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/1428

Issue

Vol. 4 No. 4 (Special Issue) (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.