Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Hubei University for Nationalities(Natural Science Edition)》 2018-01
Add to Favorite Get Latest Update

Neighbor Sum Distinguishing Edge Colorings of Four Types of Product Graphs of Infinite Path

CAI Xiahong;TIAN Shuangliang;JIAO Susu;YANG Kan;School of Mathematics and Computing Science,Northwest Minzu University;  
For a proper [k]-edge coloring φ of a graph G,if for any edge uv∈E(G),we have S_φ(u)≠S_φ(v),then φ is a neighbor sum distinguishing [k]-edge coloring of G,let S_φ(v) denote the sum of the colors of all incident edges of vertex v.The neighbor sum distinguishing edge coloring of the four types of product graphs are studied,such as the cartesian product,direct product,strong product and semistrong product of infinite paths.And the neighbor sum distinguishing edge chromatic number of these product graphs are obtained.
【Fund】: 国家民委科研项目(14XBZ018);; 西北民族大学科研创新团队(图论与智能计算)计划资助;西北民族大学中央高校基本科研业务费专项资金资助研究生项目(Yxm2017103)
【CateGory Index】: O157.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved