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

• Articles • Previous Articles     Next Articles

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

PDF (PC)

1233

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

CLC Number: 

  • O157.5
[1] HE Xue, TIAN Shuang-liang. Adjacent vertex-distinguishing edge/total colorings of double graph of some graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(04): 63-66.
[2] WEN Fei1, WANG Zhi-wen2, WANG Hong-jie3, BAO Shi-tang4, LI Mu-chun1*, ZHANG Zhong-fu1. Vertex-distinguishing total coloring of some complement double graphs [J]. J4, 2011, 46(2): 45-50.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd