期刊文献+

关于匹配等价图的构造

Construction of the matching equivalent graphs
下载PDF
导出
摘要 目的讨论简单无向图的匹配等价问题。方法利用匹配多项式的定义和性质推导。结果给出了2个匹配等价定理。结论找到了大量的匹配等价图。 Aim To discuss the matching equivalence of the simple undirected graph. Methods The character and definition of matching polynomials are used to compute. Results Two matching equivalence theorems are given. Conclusion Many matching equivalence of graphs are obtained.
作者 申世昌
出处 《宝鸡文理学院学报(自然科学版)》 CAS 2008年第2期86-87,共2页 Journal of Baoji University of Arts and Sciences(Natural Science Edition)
基金 教育部自然科学重点研究项目(206156)
关键词 匹配多项式 匹配等价 匹配唯一 matching polynomials, matching equivalence matching uniqueness
  • 相关文献

参考文献8

二级参考文献26

  • 1郭知熠,俞玉森.关于两类图的匹配唯一性[J].应用数学,1989,2(2):25-30. 被引量:29
  • 2Godsil C D. Algebraic Combinatorics. New York. London: Chapman and Hall, 1993.
  • 3Beezet R A, Farrell E J. The matching polynomials of a regular graph. Discrete Math. 1995, 137:7-8.
  • 4Bondy J. A., Murty U. S. R., Graph Theory with Applications, Amsterdam: North-Holland, 1976.
  • 5Joe L. Mott, Abraham Kandel, Theodorep Baker Discrete Mathematics for Computer Scientists, Reston,Virginia, 1983.
  • 6Liu Ruying, Adjoint polynomials and chromatically unique Graphs, Discrete Mathematic, 1997, 172: 85-92.
  • 7Zhang Bingru, The method of determining Irreducible paths Pn (n≥2), J. Acta Math. Scientia, 1997,17(Special issue): 114-119.
  • 8GODSIL C D. Algebraic Combinatorics [M]. New York. London: Chapm an and Hall,1993.
  • 9FARRELL E J. An introduction to matching polynomials[J]. Combinatoria Theory, 1979, 27(B): 76-86.
  • 10BEEZER R A, FARRELL E J. The matching polynomials of a regular graph [J]. Discrete Math. ,1995, 137: 7-8.

共引文献87

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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