Adjacent Vertex Distinguishing Incidence Coloring of the Cartesian Product of Some Graphs

作     者：Qian WANG Shuang Liang TIAN 

作者机构：Department of Mathematics and Computer Science Northwest University for Nationalities Gansu 730030 P. R. China 

出 版 物：《Journal of Mathematical Research and Exposition》 (数学研究与评论（英文版）)

年 卷 期：2011年第31卷第2期

页      面：366-370页

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the State Ethnic Affairs Commission of China (Grant No. 08XB07) 

主　　题：Cartesian product incidence coloring adjacent vertex distinguishing incidence coloring adjacent vertex distinguishing incidence chromatic number 

摘      要：An adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of *** obtain the adjacent vertex distinguishing incidence chromatic number of the Cartesian product of a path and a path,a path and a wheel,a path and a fan,and a path and a star.