QQ客服 官方微博 反馈留言

	On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition
	Chen, M. R. ; Guo, X. F. ; Guo XF(郭晓峰)
	2010-10
关键词	OBSERVABILITY
英文摘要	NSFC [10831001]; An edge coloring is proper if no two adjacent edges are assigned the same color and vertex-distinguishing proper coloring if it is proper and incident edge sets of every two distinct vertices are assigned different sets of colors. The minimum number of colors required for a vertex-distinguishing proper edge coloring of a simple graph G is denoted by (chi) over tilde'(G). In this paper, we prove that (chi) over tilde'(G) <= Delta(G) + 4 if G = (V, E) is a connected graph of order n >= 3 and sigma(2)(C) >= n, where sigma(2)(G) = min{d(x) + d(y)| for all xy is not an element of E(G)}.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/66734]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	Chen, M. R.,Guo, X. F.,Guo XF. On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition[J],2010.
APA	Chen, M. R.,Guo, X. F.,&郭晓峰.(2010).On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition..
MLA	Chen, M. R.,et al."On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。