Translator Disclaimer
2020 Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
Ramy Shaheen, Ziad Kanaya, Khaled Alshehada
J. Appl. Math. 2020(none): 1-4 (2020). DOI: 10.1155/2020/6475427

Abstract

Let G = V , E be a graph, and two players Alice and Bob alternate turns coloring the vertices of the graph G a proper coloring where no two adjacent vertices are signed with the same color. Alice's goal is to color the set of vertices using the minimum number of colors, which is called game chromatic number and is denoted by χ g G , while Bob's goal is to prevent Alice's goal. In this paper, we investigate the game chromatic number χ g G of Generalized Petersen Graphs G P n , k for k 3 and arbitrary n , n -Crossed Prism Graph, and Jahangir Graph J n , m .

Citation

Download Citation

Ramy Shaheen. Ziad Kanaya. Khaled Alshehada. "Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs." J. Appl. Math. 2020 1 - 4, 2020. https://doi.org/10.1155/2020/6475427

Information

Received: 20 December 2019; Accepted: 10 March 2020; Published: 2020
First available in Project Euclid: 14 May 2020

MathSciNet: MR4103747
Digital Object Identifier: 10.1155/2020/6475427

Rights: Copyright © 2020 Hindawi

JOURNAL ARTICLE
4 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.2020 • 2020
Back to Top