您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

J4 ›› 2009, Vol. 44 ›› Issue (12): 25-29.

• 论文 • 上一篇    下一篇

若干倍图的Smarandachely邻点边染色

朱恩强1,王治文 2 ,张忠辅1   

  1. 1. 兰州交通大学应用数学研究所, 甘肃 兰州 730070; 2. 宁夏大学数学与计算机学院, 宁夏 银川 750021
  • 收稿日期:2009-01-08 出版日期:2009-12-16 发布日期:2010-02-05
  • 作者简介:朱恩强(1983-),男,硕士研究生,研究方向为图论及组合优化.Email: zhuenqiang@163.com
  • 基金资助:

    国家自然科学基金资助项目(10771091);兰州交通大学学生科研创新立项(DXS 2008028)1114);陕西省自然科学基础研究计划资助项目(SJ08A20)

On the Smarandachelyadjacentvertex edge coloring of some double graphs

ZHU Enqiang 1 , WANG Zhiwen 2 , ZHANG Zhongfu 1   

  1. 1. Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China;
    2. College of Mathematics and Computer, Ningxia University, Yinchuan 750021, Ningxia, China
  • Received:2009-01-08 Online:2009-12-16 Published:2010-02-05

摘要:

图G(V,E)的Smarandachely邻点边色数是满足条件uv∈E(G),|C(u)\C(v)|≥1并且|C(v)\C(u)|≥1的一个正常边染色的最小边色数,其中C(u)={f(uv)|uv∈E(G)}。给出了路、圈、星、扇图的倍图的Smarandachely邻点边色数。

关键词: 倍图, Smarandachely邻点边染色, k正常边染色

Abstract:

The Smarandachelyadjacentvertex edge chromatic number of graph G is the smallest k for which G has a proper edge kcoloring. For any pair of adjacent vertices, the set of colors appearing at either vertex’s incident edges is not a subset of the set of colors appearing at the other vertex’s incident edges. The smarandachely adjacent vertex edge chromatic number of some double graphs are obtained.

Key words: the Smarandachelyadjacentvertex edge coloring of a graph, proper edge kcoloring, double graph

中图分类号: 

  • O157.5
[1] 何雪, 田双亮. 若干图的倍图的邻点可区别边(全)染色[J]. 山东大学学报(理学版), 2015, 50(04): 63-66.
[2] 文飞1,王治文2, 王鸿杰3, 包世堂4, 李沐春1*,张忠辅1. 若干补倍图的点可区别全染色[J]. J4, 2011, 46(2): 45-50.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!