首页 | 本学科首页   官方微博 | 高级检索  
     检索      

-K3V Kn 的Smarandachely邻点可区别正常边染色
引用本文:刘顺琴,陈祥恩.-K3V Kn 的Smarandachely邻点可区别正常边染色[J].兰州理工大学学报,2011,37(1):139-145.
作者姓名:刘顺琴  陈祥恩
作者单位:1. 福建师范大学闽南科技学院,福建,泉州,362332
2. 西北师范大学数学与信息科学学院,甘肃,兰州,730070
基金项目:国家自然科学基金(10771091)
摘    要:图的染色问题是图论研究的主要内容之一,起源于著名的"四色猜想"问题.图G的一个正常边染色f称为是Smarandachely邻点可区别的,如果对G中任何相邻的两个顶点u与v,与u关联的边的颜色的集合和与v关联的边的颇色构成的集合互不包含.对一个图G进行Smarandachely邻点可区别正常边染色所用的最少颜色数称为G的...

关 键 词:  完全图  Smarandachely邻点可区别正常边染色  Smarandachely邻点可区别正常边色数

Smarandachely adjacent-vertex-distinguishing proper edge coloring of -K3 V Kn
LIU Shun-qin,CHEN Xiang-en.Smarandachely adjacent-vertex-distinguishing proper edge coloring of -K3 V Kn[J].Journal of Lanzhou University of Technology,2011,37(1):139-145.
Authors:LIU Shun-qin  CHEN Xiang-en
Institution:LIU Shun-qin1,CHEN Xiang-en2(1.Minnan Science and Technology Institute,Fujian Normal University,Quanzhou 362332,China,2.College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China)
Abstract:A proper edge coloring of G would be a Smarandachely adjacent vertex distinguishing edge coloring if for any two adjacent vertices u and v,the set of colors appearing on the edges incident to u and that appearing on the edges incident to v were not included with each other.The smallest number of colors used for smarandachely adjacent-vertex-distinguishing proper edge coloring of G exists was called the Smarandachely adjacent vertex distinguishing edge chromatic number,or SA-edge chromatic number for short,a...
Keywords:graphs  complete graphs  Smarandachely adjacent-vertex-distinguishing proper edge coloring  Smarandachely adjacent-vertex-distinguishing proper edge chromatic number  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号