Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs

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 chromat...

Full description

Saved in:
Bibliographic Details
Main Authors: Ramy Shaheen, Ziad Kanaya, Khaled Alshehada
Format: Article
Language:English
Published: Wiley 2020-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2020/6475427
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832554997789753344
author Ramy Shaheen
Ziad Kanaya
Khaled Alshehada
author_facet Ramy Shaheen
Ziad Kanaya
Khaled Alshehada
author_sort Ramy Shaheen
collection DOAJ
description 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 χgG, while Bob's goal is to prevent Alice's goal. In this paper, we investigate the game chromatic number χgG of Generalized Petersen Graphs GPn,k for k≥3 and arbitrary n, n-Crossed Prism Graph, and Jahangir Graph Jn,m.
format Article
id doaj-art-636ad762faec4e9d98a34d56134ba734
institution Kabale University
issn 1110-757X
1687-0042
language English
publishDate 2020-01-01
publisher Wiley
record_format Article
series Journal of Applied Mathematics
spelling doaj-art-636ad762faec4e9d98a34d56134ba7342025-02-03T05:49:52ZengWileyJournal of Applied Mathematics1110-757X1687-00422020-01-01202010.1155/2020/64754276475427Game Chromatic Number of Generalized Petersen Graphs and Jahangir GraphsRamy Shaheen0Ziad Kanaya1Khaled Alshehada2Department of Mathematics, Faculty of Science, Tishreen University, Lattakia, SyriaDepartment of Mathematics, Faculty of Science, Tishreen University, Lattakia, SyriaDepartment of Mathematics, Faculty of Science, Tishreen University, Lattakia, SyriaLet 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 χgG, while Bob's goal is to prevent Alice's goal. In this paper, we investigate the game chromatic number χgG of Generalized Petersen Graphs GPn,k for k≥3 and arbitrary n, n-Crossed Prism Graph, and Jahangir Graph Jn,m.http://dx.doi.org/10.1155/2020/6475427
spellingShingle Ramy Shaheen
Ziad Kanaya
Khaled Alshehada
Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
Journal of Applied Mathematics
title Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
title_full Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
title_fullStr Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
title_full_unstemmed Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
title_short Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
title_sort game chromatic number of generalized petersen graphs and jahangir graphs
url http://dx.doi.org/10.1155/2020/6475427
work_keys_str_mv AT ramyshaheen gamechromaticnumberofgeneralizedpetersengraphsandjahangirgraphs
AT ziadkanaya gamechromaticnumberofgeneralizedpetersengraphsandjahangirgraphs
AT khaledalshehada gamechromaticnumberofgeneralizedpetersengraphsandjahangirgraphs