Game chromatic number of lexicographic product graphs

被引：1

作者：

Alagammai, R. ^{[1
]}

Vijayalakshmi, V. ^{[1
]}

机构：

[1] Anna Univ, Dept Math, MIT Campus, Chennai 600044, Tamil Nadu, India

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2015年 / 12卷 / 2-3期

关键词：

Graphs; Game chromatic number; Lexicographic product;

D O I：

10.1016/j.akcej.2015.11.017

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, we determine the exact values of the game chromatic number of lexicographic product of path P-2 with path P-n, star K-1,K-n and wheel W-n. Also we give an upper bound for the game chromatic number of lexicographic product of any two simple graphs G and H. (C) 2015 Production and Hosting by Elsevier B.V. on behalf of Kalasalingam University.

引用

页码：216 / 220

页数：5