期刊文献+

一类新图的匹配唯一性 被引量:3

The Matching Uniqueness of A New Graphs
原文传递
导出
摘要 利用图的匹配多项式及其最大实数根的性质证明了树T(1,1,n,2,1)及补图匹配唯一的充要条件是n≠1,2,5,8. Using the properties of graph's matching polynomial and it's maximum real roots,we prove that T(1,1,n,2,1) and its complement is matching uniqueness if and only ifn≠1,2,5,8.
机构地区 河池学院数学系
出处 《数学的实践与认识》 CSCD 北大核心 2010年第23期206-211,共6页 Mathematics in Practice and Theory
基金 国家自然科学基金(10761008) 广西教育厅科研项目(200911LX402) 河池学院科研项目(2008QS-N007 N008 2009A-N004 N005)
关键词 匹配多项式 匹配等价 匹配唯一 匹配多项式最大实数根 matching polynomial matching equivalence matching uniqueness the maximum real roots of graph's matching polynomial
  • 相关文献

参考文献7

  • 1Godsil C D.Algebraic Combinatorics[M].New York:Chapman and Hall,1993.
  • 2Bondy J A,Murty U S R.Graph Theory with Applications[M].North -Holland,Amsterdam,1976.
  • 3Ma Haicheng.Graphs characterized by the roots of matching[J].Journal of Qufu Normal University,2001,27(1):33-36.
  • 4马海成,赵海兴.小度数或大度数图中的匹配唯一图[J].Journal of Mathematical Research and Exposition,2004,24(2):369-373. 被引量:12
  • 5KCvetkovic D,Rowlinson P.The largest eigenvalue of a graph:A survey[J].Linear and Multilinear Algebra,1990,28(1,2):3-33.
  • 6Cvetkovic D M,Doob M,Gutman I,Torgaser A.Recent Result in the Theory of Graph Spectra[M].New York:Elsevier Science Publishers,1988.
  • 7马海成.2<M(G)≤((2+5~(1/2))~(1/2)的图G[J].内蒙古大学学报(自然科学版),2005,36(5):485-487. 被引量:10

二级参考文献13

共引文献16

同被引文献18

  • 1Hall P. On Representatives of Subsets[J]. London Math Soc,1935,10:26- 30.
  • 2GaryC,PingZ.图论导引[M].范益政,译.北京:人民邮电出版社,2007.
  • 3Bela B,Alex S. Max k-cut and Judicious k-partitions[ J]. Discrete Mathematics,2010,310:2126 -2139.
  • 4M a J, Yan P L, Yu X X. On Several Partitioning Problems of Ballobas and Scott [ J ]. Journal of Combinatorial Theroy,2010 100:631 - 649.
  • 5Xu B G,Yu X X. Judicious k-partitions of Graphs[ J]. Journal of Combinatorial Theroy,2009,99:324 - 337.
  • 6Bondy J A, Murty U S R. Graph Theory with Applications[M].Amsterdam:North -Holland, 1976.
  • 7Godsil C D. Algebraic Combinatorics [M]. New York: Chapman and Hall, 1993.
  • 8Clemens Heuberger, Stephan G. Wagner. Chemical trees minimizing energy and Hosoya index[J]. J Math Chem, 2009, 46: 214-230.
  • 9Ye Chengfu, Wang Jianfeng. Trees with -matchings and the fourth and fifth minimal[J]. Computers and Mathematics with Applications, 2008, 56: 387-399.
  • 10Ma Haicheng, Ren Haizhen. The new methods for constructing matching-equivalence Graphs [J] Discrete Mathematics, 2007, 307: 125-131.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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