Journals / Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics / 2020 / Cilt: 69 - Sayı: 2

On star coloring of modular product of graphs

Pages
1235–1239
Publication Date
2020-12-31
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The star chromatic number $\chi_{s}\left(G\right)$ of $G$ is the least number of colors needed to star color $G$. \par During the years star coloring of graphs has been studied extensively by several authors, for instance see \cite{alberton, col, fertin}.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:A star coloring of a graph $G$ is a proper vertex coloring in which every path on four vertices in $G$ is not bicolored.
📊
Key Findings & Data:In this paper, we find the exact values of the star chromatic number of modular product of complete graph with complete graph $K_m \diamond K_n$, path with complete graph $P_m \diamond K_n$ and star graph with complete graph $K_{1,m}\diamond K_n$. \par All graphs in this paper are finite, simple, connected and undirected graph and we follow \cite{bm, cla, f} for terminology and notation that are not defined here.
💡
Conclusion & Impact:The star chromatic number $\chi_{s}\left(G\right)$ of $G$ is the least number of colors needed to star color $G$. \par During the years star coloring of graphs has been studied extensively by several authors, for instance see \cite{alberton, col, fertin}.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Star Coloring · Modular Product · Star graph

Abstract

A star coloring of a graph $G$ is a proper vertex coloring in which every path on four vertices in $G$ is not bicolored. The star chromatic number $\chi_{s}\left(G\right)$ of $G$ is the least number of colors needed to star color $G$. In this paper, we find the exact values of the star chromatic number of modular product of complete graph with complete graph $K_m \diamond K_n$, path with complete graph $P_m \diamond K_n$ and star graph with complete graph $K_{1,m}\diamond K_n$. \par All graphs in this paper are finite, simple, connected and undirected graph and we follow \cite{bm, cla, f} for terminology and notation that are not defined here. We denote the vertex set and the edge set of $G$ by $V(G)$ and $E(G)$, respectively. Branko Gr\"{u}nbaum introduced the concept of star chromatic number in 1973. A star coloring \cite{alberton, fertin, bg} of a graph $G$ is a proper vertex coloring in which every path on four vertices uses at least three distinct colors. The star chromatic number $\chi_{s}\left(G\right)$ of $G$ is the least number of colors needed to star color $G$. \par During the years star coloring of graphs has been studied extensively by several authors, for instance see \cite{alberton, col, fertin}.

🔖

Cite This Article

K, K., R, S., J, V. V. (2020). On star coloring of modular product of graphs. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, Cilt: 69 - Sayı: 2, 1235–1239. https://ajindex.com/articles/746791

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (3)

  1. Albertson, M.O., Chappell, G.G., Kierstead, H.A., Kündgen, A., Ramamurthi, R., Coloring with no 2-colored P4’s. The Electronic Journal of Combinatorics 11 (2004), R26, doi:10. 37236/1779. Bondy, J.A., Murty, U.S.R. Graph theory with applications, MacMillan, London 1976.
  2. Clark, J., Holton, D. A., A …rst look at graph theory, World Scienti…c, 1991, doi:10.1142/1280. [ Coleman, T.F., Moré, J., Estimation of sparse Hessian matrices and graph coloring problems, Mathematical Programming, 28(3) (1984), 243–270, doi:10.1007/BF02612334. Fertin, G., Raspaud, A., Reed, B., On Star coloring of graphs, Journal of Graph theory, 47(3) (2004), 163–182, doi:10.1002/jgt.20029. Grünbaum, B., Acyclic colorings of planar graphs, Israel Journal of Mathematics, 14 (1973), 390–408, doi:10.1007/BF02764716 Harary, F., Graph theory, Narosa Publishing Home, New Delhi, 1969.
  3. Imrich, W., Klavµzar, S., Product Graphs: Structure and Recognition, Wiley, New York 2000.