您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

J4 ›› 2010, Vol. 45 ›› Issue (6): 27-30.

• 论文 • 上一篇    下一篇

λ3,q-连通图的刻画

肖海强1,2,张昭1*   

  1. 1.新疆大学数学与系统科学学院, 新疆 乌鲁木齐 830046; 2.师范学院,石河子大学, 新疆 石河子 832003
  • 收稿日期:2009-05-22 出版日期:2010-06-16 发布日期:2010-06-17

Characterization of λ3,q-connected graphs

XIAO Hai-qiang1,2, ZHANG Zhao1*   

  1. 1. College of Mathematics and System Sciences, Xinjiang University, Urumqi  830046, Xinjiang, China;
    2. Normal School, Shihezi University, Shihezi 832003, Xinjang, China
  • Received:2009-05-22 Online:2010-06-16 Published:2010-06-17
  • Contact: ZHANG Zhao(1974-), female, doctorial tutor, his insterests mainly focuses on conbinatorial optimization and graph theory.
  • About author:XIAO Hai-qiang(1981-), male, graduate student, his insterests mainly focuses on conbinatorial optimization and graph theory.Email:xjxhq2010@sina.com.cn
  • Supported by:

    The rescarch is supported by National Natural Science Foundation of China(60603003); the Key Project of Chincse Ministry of Education(208161); the Program for New Century Excellent Talents in University.

摘要:

连通图G称为λ3,q -连通的如果存在边割S使得G-S有两个阶数分别至少为p和q的连通分支。给出一个图是λ3,q -连通的一些充分和必要条件。

关键词: 限制性边连通度;连通图;生成树

Abstract:

A connected graph G is λp,q-connected if there is an edge set S such that G-S has two components of order at least p and q, respectively.  Some necessary and sufficient conditions for a graph to be λ3,q-connected are presented.

Key words: restricted edge connectivity;connected graph;spaning tree

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!