华东师范大学学报(自然科学版) ›› 2009, Vol. 2009 ›› Issue (1): 13-21.

• 应用数学与基础数学 • 上一篇    下一篇

单圈图的解析(英文)

王晓1, 段芳2

  

  1. 1.商洛学院 数学系, 陕西商洛 726000; 2.新疆师范大学 数理信息学院, 乌鲁木齐 830054
  • 收稿日期:2008-06-03 修回日期:2008-08-20 出版日期:2009-01-25 发布日期:2009-01-25
  • 通讯作者: 王晓

On dissection of unicyclic graphs(English)

WANG Xiao1, DUAN Fang2   

  1. 1. Department of Mathematics, Shangluo University, Shangluo Shanxi} 726000, China; 2.School of Maths-Physics and Information Science, Xinjiang Normal University, Urumqi 830054, China
  • Received:2008-06-03 Revised:2008-08-20 Online:2009-01-25 Published:2009-01-25
  • Contact: WANG Xiao

摘要: 得到了一些特殊图类的解析值.~利用数学归纳和分类讨论的方法,~%
给出固定阶数的单圈图的解析的紧的界.~%
证明了在所有阶数为~n~的单圈图中,~%
图~Δn3~取得最小的~a(G)~和~b(G);~图~K+1,n1~%
取得最大的~a(G)~和~b(G).~%
这里图~Δn3~是由联结~K3~一个顶点和~Pn3~的一个端点而得到,~%
图~K+1,n1~是由联结图~K1,n1~中两个度为~1~的顶点而得到.

关键词: 单圈图, 界, 解析, 单圈图, 界, 解析

Abstract: By the principle of mathematical induction and classified
discussion, the sharp bounds for dissection of unicyclic graphs of a
fixed order were given. Among all unicyclic graphs of order
n(n6), the graph Δn3 has the minimum a(G)
and b(G), and the graph K+1,n1 has maximum a(G) and
b(G), where Δn3 denotes the graph obtained from K3
and Pn3 by joining a vertex of K3 to one endvertex of
Pn3, and K+1,n1 denotes the graph obtained from
K1,n1 by joining its two vertices of degree one.

Key words: bound, dissection, unicyclic graphs, bound, dissection

中图分类号: