|
个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职：Director of Academic Committee at Kaifa District
其他任职：开发区校区学术分委员会主任（Director of Academic Committee at Kaifa Campus）
性别：男
毕业院校：多伦多大学
学位：博士
所在单位：软件学院、国际信息与软件学院
学科：软件工程. 运筹学与控制论
办公地点：开发区（Kaifa District Campus）
联系方式：mingchul@dlut.edu.cn
电子邮箱：mingchul@dlut.edu.cn
[r, s, t]- Colorings of Friendship Graphs and Wheels
点击次数：
论文类型：期刊论文
发表时间：2015-11-01
发表刊物：GRAPHS AND COMBINATORICS
收录刊物：SCIE、Scopus
卷号：31
期号：6
页面范围：2275-2292
ISSN号：0911-0119
关键字：[r, s, t]-coloring; [r, s, t]-chromatic number; Friendship graphs; Wheels
摘要：Given non-negative integers and , an -coloring of a graph is a mapping from to the color set such that for every two adjacent vertices , , for every two adjacent edges , , and for every vertex and an incident edge , respectively. The minimum such that admits an -coloring is called the -chromatic number of and is denoted by . In this paper, we examine exact values and upper bounds for the -chromatic number of friendship graphs and wheels for every positive integer and .