P_mⅴK_n的点可区别边染色被引量：1

The Vertex-distinguishing Edge Chromatic Number of P_mⅴK_n

下载PDF

导出

摘要得到了当路的结点个数为偶数时 ,路和完全图的联图的点可区别边色数。 In this paper.we present the vertex-distinguishing edge chromatic number of P mⅴK n,when m≡0(mod2).

作者包世堂赵传成刘君任志国

机构地区兰州师范高等专科学校

出处《甘肃高师学报》 2004年第5期16-17,共2页 Journal of Gansu Normal Colleges

关键词边色数联图完全图偶数个数结点区别 Path Complete graph Join-graphs Vertex-distinguishing Edge Chromatic Number

参考文献8

1BurrisAC,SchelpRH.Vertex-distinguishingProperEdge-colorings[].JofGraphTheory.1997
2BazganCHarkat-BenhamdineA,LiH,WozniakM.OntheVertex-distnguishingProperEdge-coloringofGraphs[].JCombinTheorySerB.1999
3BalisterPN,BollobasB,SchelpRH.Vertex-distinguishingColoringofGraphswithΔ(G)=2[].DiscreteMathemat ics.2002
4ZhongfuZhang,LinzhongLiu,JianfangWang.AdiacentStrongEdgeColoringofGraphs[].AppliedMathmaticsLetters.2002
5P N Balister,O M Riordan,and R H Schelp.Vertex-distinguishing edge colorings of graphs[].JGraph Theory.2003
6Bondy J A,and Marty U S R.Graph Theory with Applications[]..1976
7G Chartrand,L F Linda.Graphs and Diagraphs[].Ind edition Wadswirth Brokks/Cole.1986
8P.Hansen,,O.Marcotte.Graph Coloring and Application[]..1999

1陈祥恩,张忠辅.关于(K_n^-)~t 的点可区别正常边染色(英文)[J].数学研究,2004,37(4):376-380. 被引量：4
2CERNY J.HORNAK M. SOTAK R. Observability of a graph[J]. Math Stovaca, 1996, 46: 21-31.
3BURRIS A C, SCHELP R H. Vertex-distinguishing proper edge-coloring[J]. J Graph Theory, 1997, 26: 73-82.
4HORNAK M, SOTAK R. Observablility of complete multipartite graphs with equipotent parts[J]. Ars Combin, 1995, 41: 289-301.
5BAZGAN C, HARKAT-Benhamdine A, LI Hao, WOZNIAK M. On the vertex-distinguishing edge colorings of graphs[J]. J Combin Theory, 1999, 75: 288-301.

甘肃高师学报

2004年第5期

内容加载中请稍等...