期刊文献+

一些特殊Corona图的b-连续性 被引量:1

The b-continuity of Some Special Corona Graphs
下载PDF
导出
摘要 图G的b-染色是一个正常顶点染色,且在每两个色类之间至少存在一条边.图G的b-染色数是最大的整数k,满足用k种颜色能对G进行b-染色,记为b(G).一个图G称为b-连续的当且仅当对于每个正整数k,χ(G)≤k≤b(G),图G存在一个(k)b-染色.本文根据Corona图的结构性质,通过设计具体染色方案的方法,证明了一些特殊Corona图的b-连续性. The b-coloring of a graph G is a proper vertex coloring, in which every two color classes exists at least one edge. The b-chromatic number of a graph G is the largest integer k such that G admits a b-coloring with k colors. A graph G is said to be b-continuity if and only if for every integer k, χ(G) ≤ k ≤ b(G), there exists a b-coloring with k colors. In this paper, the b-continuity of some special Corona graphs is proved by designing the specific coloring scheme according to the structural properties of Corona graphs.
出处 《工程数学学报》 CSCD 北大核心 2018年第1期69-78,共10页 Chinese Journal of Engineering Mathematics
基金 国家自然科学基金(61472058)~~
关键词 b-染色 b-染色数 b-连续 m-度 Corona图 b-coloring b-chromatic number b-continuity m-degree Corona graph
  • 相关文献

参考文献1

二级参考文献13

  • 1Zahn C T.Graph-theoretical methods for detecting and descri-bing gestalt clusters [J].IEEE Transactions on Computera,1971,20(1):68-86.
  • 2Caramia M,DelLOlmo P.Coloring graphs by iterated localsearch traversing feasible and infeasible solutions [J].Dis-crete AppliedMathematics ,2008,156(2):201-217.
  • 3Bidyut Kr Patra,Sukumar Nandi P Viswanath.A distance basedclustering method for arbitrary shaped cluster in large datasets [J].Pattern Recognition,2011,44(12):2862-2870.
  • 4Elghazel H,Yoshida T,Deslandres V,et al.A new greedyalgorithm for improving b-coloring clustering [G].LectureNotes in Computer Science 4538 :Graph Based Representationsin Pattern Recognition-GBR,2007 :228-239.
  • 5Wang F,Zhang C S.Label propagation through linear neigh-borhoods [J].IEEE Transactions on Knowledge and Data En-gineering,2008,20(1):55-67.
  • 6Asuncion A,Newman D J.UCI Machine Learning Repository[D].http://www.ics.uci.edu/?mleam/MLRepository.ht-ml.Irvine,CA; University of California,2007.
  • 7Von Luxburg.A tutorial on spectral clustering [J].Statisticsand Computing,2007,17(4) :395-416.
  • 8Li Y J.A clustering algorithm based on maximal 0-distant sub-trees [J].PattemRecognition,2007,40(5) :1425-1431.
  • 9Guo J,Kanj I A,Komusiewicz C,et al.Editing graphs intodisjoint unions of dense clusters [G].LNCS 5878:Proc 20thISAAC.Springer,2009 :583-593.
  • 10Talmaciu M,Nechita E.Recognition algorithm for diamond-free graphs [J].Informatica,2007,18(3) :457-462.

共引文献4

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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