COLLEGE OF SCIENCE Mathematics Department Invites you to the SEMINAR/LECTURE Entitled Game Chromatic Number of Friendship Graphs Given by Yvette Fajardo-Lim,Ph.D. on Wednesday, September 17, 2014 16:15-17:15, SJ 203 Abstract: Friendship graphs were first characterized by Erdös, Rényi and Sós as graphs without cycles of order four in which every pair of vertices is connected by a path of length two. This equates to a graph consisting of triangles, which all share a common vertex and no two of which share a common edge. The graph coloring game described in this paper has two players, Alice and Bob. Both of them take turns in coloring vertices of a graph, with the only rule that adjacent vertices cannot have the same color. Alice wins if all vertices have been colored. Otherwise, Bob wins. The game chromatic number of a graph G denoted by χg(G), is defined as the least number of colors for which Alice has a winning strategy. This paper aims to establish the game chromatic number of a friendship graph.
Posted on: Sun, 14 Sep 2014 14:49:07 +0000
Trending Topics
Recently Viewed Topics
© 2015