Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs

Ramy Shaheen, Ziad Kanaya and Khaled Alshehada

Journal of Applied Mathematics, 2020, vol. 2020, issue 1

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 GP(n, k) for k ≥ 3 and arbitrary n, n‐Crossed Prism Graph, and Jahangir Graph Jn,m.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2020/6475427

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2020:y:2020:i:1:n:6475427

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().