期刊文献+

几类Corona图的b-染色数 被引量:2

The b-chromatic Number of Some Corona Graphs
下载PDF
导出
摘要 设{V_1,V_2,···,V_k}为图G=(V,E)的一个正常顶点染色,满足对任意的i,j:1≤i≠j≤k,存在于u∈V_i,v∈V_j,使得uv∈E,称该点染色为G的一个b-染色.一个图G的b-染色数是最大的整数k,满足用k种颜色能对G进行b-染色,用b(G)来表示.如果对任意的k:χ(G)≤k≤b(G),图G都存在一个(k)b-染色{V_1,V_2,···,V_k},称G是b-连续的.根据Corona图的结构特点,设计循环染色方案,通过对Corona图中两种类型的顶点进行循环染色,得出几类Corona图的b-染色数等于其m-度,且这些Corona图满足b-连续性. Let{V1;V2;···;Vk}be a proper vertex coloring of a graph G=(V;E),which is called a b-coloring of G,if for all i;j:1≤i?=j≤k,exists u∈Vi;v∈Vj,satisfying uv∈E.The maximum positive integer k for a b-coloring{V1;V2;···;Vk}on a graph G is called the b-chromatic number,denoted by b(G).A graph G is called b-continuity if for all k:(G)≤k≤b(G),there exists a(k)b-coloring on graph G.According to the structural char-acteristics of the Corona graphs,the cyclic coloring schemes are constructed.Through the cyclic coloring on two kinds of vertices of Corona graphs,the b-chromatic number of several Corona graphs equalling to its m-degree is obtained,and all these Corona graphs are b-continuous.
作者 吕闯 王科伦 LV Chuang;WANG Ke-lun(Mathematics Teaching and Research Department,Jilin Medical University,Jilin 132013;Department of Mathematics,Dalian Maritime University,Dalian 116026)
出处 《工程数学学报》 CSCD 北大核心 2018年第4期445-456,共12页 Chinese Journal of Engineering Mathematics
基金 国家自然科学基金(61472058)~~
关键词 b-染色 b-染色数 b-连续 m-度 Corona图 循环染色 b-coloring b-chromatic number b-continuity m-degree Corona graph cyclic col-oring scheme
  • 相关文献

参考文献3

二级参考文献33

  • 1F.Harary,S.Hedetniemi.The achromatic number of a graph[J].Combin.Theory,1970,8(2):154-161.
  • 2R.Irving,D.Manlove.The b-chromatic number of graphs[J].Discrete Appl.Math.1999,91(1-3):127-141.
  • 3S.Francis Raj,R.Balakrishnan.Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs[J].Electronic Notes in Discrete Mathematics,2009,34:353-358.
  • 4V.Campos,C.Linhares Sales,F.Maffray,A.Silva.b-chromatic number of cacti[J].Electronic Notes in Discrete Mathematics,2009,35:281-286.
  • 5C.Linhares Sales,L.Sampaio.b-coloring of m-tight graphs[J].Electronic Notes in Discrete Mathematics,2009,35:209-214.
  • 6T.Faik.About the b-continuity of graphs[J].Electronic Notes in Discrete Mathematics,2004,17:151-156.
  • 7H.Elghazel,V.Deslandres,M.S.Hacid,A.Dussauchoy,H.Kheddouci.A new clustering approach for symbolic data and its validation:application to the healthcare data[J].LNAI,2006,4203:473-482.
  • 8H.Elghazel,H.Kheddouci,V.Deslandres,A.Dussauchoy.A Partially Dynamic Clustering Algorithm for Data Insertion and Removal[J].LNAI,2007,4755:78-90.
  • 9H.Elghazel,K.Benabdeslem,A.Dussauchoy.Constrained Graph b-Coloring Based Clustering Approach[J].LNCS 2007,4654:262-271.
  • 10L.Dekar,H.Kheddouci.A Graph b-Coloring Based Method for Composition-Oriented Web services Classification[J].LNAI,2008,4994:599-604.

共引文献4

同被引文献4

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部