J4 ›› 2011, Vol. 24 ›› Issue (2): 1-5.

• 目录 •    下一篇

无三角形图超级-λk性的邻域条件

 黄丽, 高敬振   

  1. 山东师范大学数学科学学院,山东 济南 250014
  • 收稿日期:2010-09-08 出版日期:2011-04-20 发布日期:2011-04-20
  • 基金资助:

    国家自然科学基金(10901097);山东省高等学校科技计划(J10LA11)

A neighborhood condition of a super -λk trianglefree graph

 HUANG Li, GAO Jing-Zhen   

  1. School of Mathematics, Shandong Normal University, Jinan 250014, China
  • Received:2010-09-08 Online:2011-04-20 Published:2011-04-20

摘要:

       设k为正整数,G是阶n≥2k的无三角形图。如果G中每一对不相邻的点u,v满足|N(u)∩N(v)|≥k+1,则G是超级-λk的,或者G≌Kk+1,n-k-1。这一结果在网络可靠性分析中有一定应用。

关键词: 图, k-限制边连通度, 超级-&lambda, k

Abstract:

Let  k be a positive integer, and G be a connected trianglefree graph of order n≥2k. We prove that  G is a superk graph or Kk+1,n-k-1 if each pair of nonadjacent vertices u,v satisfy |N(u)∩N(v)|≥k+1.This result can be applied to the analysis of network reliability.

Key words: graph, restricted edge connectivity, super -λk graph

中图分类号: 

  • O157.5