期刊文献+

一类稠密图色性的刻画 被引量:1

Characterization for the Chromaticity of a Class of the Dense Graphs
下载PDF
导出
摘要 针对大量非色唯一图,利用图的伴随多项式,最小根及其特征标的性质研究了一类稠密图的色性:完整刻画了该类稠密图的色等价图类,并给出了其色唯一的充要条件.这为图的色性研究提供了新的工具和方法. In allusion to a large number of non-chromatically unique graphs, the chromaticity of a class of the dense graphs is studied by applying the properties of graphls adjoint polynomial, minimum roots and character features. The chromatically characterized, and the chromatically unique s The new tools and methods are provided for equivalent classes of the dense graphs are completely ufficient and necessary condition of the graphs is obtained. the chromaticity research of graphs.
机构地区 河池学院数学系
出处 《中北大学学报(自然科学版)》 CAS 北大核心 2011年第3期253-259,共7页 Journal of North University of China(Natural Science Edition)
基金 国家自然科学基金资助项目(10761008) 广西自然科学基金资助项目(桂科自0991265) 广西教育厅科研项目(200911LX402) 河池学院科研项目(2009A-N004 N0052008QS-N007 N008)
关键词 色等价 色唯一 伴随多项式 伴随等价 伴随唯一 最小根 chromatically equivalent chromatically uniqueness adjoint polynomial adjoint equivalent adjoint uniqueness minimum root
  • 相关文献

参考文献20

  • 1王建锋,王静,冶成福.稠密图■的色唯一性[J].西南大学学报(自然科学版),2009,31(4):16-20. 被引量:5
  • 2Bondy J A, Murty U S R. Graph Theory with Applications[M]. North Holland: Amsterdam, 1976.
  • 3Liu R Y. Adjoint polynomials and chromatically unique graph[J]. Discrete Mathematics, 1997, 172: 85-92.
  • 4Liu R Y, Zhao L C. A new method for proving chromatic uniqueness of graphs [J]. Discrete Mathematics, 1997, 171: 169-177.
  • 5Zhao H X, Li X L, Zhang S G, et al. On the minimum real roots of the a-polynomials and chromatic uniqueness of graphs[J].Discrete Math, 2004, 281: 277-294.
  • 6Li N Z, Bao X W, Liu R Y. Chromatic uniqueness of the complements of certain forests~J]. Discrete Mathematics, 1997, 172:79-84.
  • 7Liu R Y, Zhao H X, Ye C F. A complete solution to a conjectureon chromatic uniqueness of complete tripartite graphs[J].Discrete Mathematics, 2004, 289: 175-179.
  • 8孙晓玲,杜建伟.一类外平面图的邻点可区别全染色[J].中北大学学报(自然科学版),2009,30(1):1-4. 被引量:5
  • 9杜清晏.图的参数π(G)及其图的分类[J].内蒙古大学学报(自然科学版),1995,26(3):258-262. 被引量:36
  • 10Cvetkovic D, Rowlinson P. The largest eigenvalue of a graph: a survey[J]. Lin. Multilin. Alg. 1990, 28: 3-33.

二级参考文献36

共引文献57

同被引文献15

  • 1Bondy J A, Murty U S R. Graph theory with applications [M]. New York: American Elsevier Pub. Co., 1976.
  • 2Read R C, Tutte W T. Chromatic polynomials. Selected topics in graph theory [M]. New York: Academic Press, 1988.
  • 3Koh K M, Teo K L. The search for chromatically unique graphs [J]. Graphs and Combinatorics, 1990 (6) : 259-285.
  • 4Koh K M, Teo K L. The search for chromatically unique graphs (II) [J]. Discrete Math, 1997 (172) 59.
  • 5Dong F M, Teo K L, invatiants of adjointly Australasian Journal of 133-143. Little C H C, et al. Two equivalent graphs [ J ]. Combinatorics, 2002 (25) ..
  • 6Dong F M, Koh K M, Teo K L. Chromatic polynomials and chromaticity of graphs [M]. Singapore : World Scientific, 2005.
  • 7Su Keyi, Chen Xiangen. A note on chromatic uniqueness of completely tripartite graphs [J]. Journal of Mathematical Research and Exposition, 2010, 30(2).. 233-240.
  • 8Roslan H, Mohamad S N F. On chromatic equivalence pair of a family of K4-homeomorphs [J]. Applied Mathematical Sciences, 2011 (70):3481-3490.
  • 9Catada-Ghimire S, Roslan H. On chromatic equivalence of K4-homeomorphs [J]. Southeast Asian Bulletin of Mathematics, 2011(35): 591.
  • 10Liu Ruying, Zhao Lianchang. A new method for proving chromatic uniqueness of graphs[J]. Discrete Math, 1977(171): 169-177.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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