浏览全部资源
扫码关注微信
山东师范大学
Published:1995,
扫 描 看 全 文
[1]高敬振.极大路原理与图中的路和圈[J].济南大学学报(综合版),1995,{4}(02):84-86.
Gao Jingzhen. MAXIMAL PATH PRINCIPLE AND PATHS AND CYCLES IN GRAPHS. [J]. Journal of University of Jinan(Social Science Edition) (2):84-86(1995)
[1]高敬振.极大路原理与图中的路和圈[J].济南大学学报(综合版),1995,{4}(02):84-86. DOI:
Gao Jingzhen. MAXIMAL PATH PRINCIPLE AND PATHS AND CYCLES IN GRAPHS. [J]. Journal of University of Jinan(Social Science Edition) (2):84-86(1995) DOI:
设G为n阶2—连通图
顶点v
1
v
2
…
n
满足d
≤d
≤…≤d
其中d
i
=d(v
)
i=1
n.本文主要给出周长c(G)≥min{n
m}的如下条件:
Let G be a 2-connected graph of order n with vertices v1
v2
vn
satisfying where di = d(vi) for all (?). This paper establishes the following sufficient condition guaranting the circumference of G
极大y—路极大路原理周长次条件
maximal y-pathmaximal path principlecircumferencedegree condition
0
Views
22
下载量
CNKI被引量
Publicity Resources
Related Articles
Related Author
Related Institution