首页 | 本学科首页   官方微博 | 高级检索  
     检索      

关于元爪图的一个性质(英文)
引用本文:鲁晓旭,李静,吴敏.关于元爪图的一个性质(英文)[J].数学季刊,2011(3):445-447.
作者姓名:鲁晓旭  李静  吴敏
作者单位:Department of Mathematics and Physics;Zhengzhou Institute of Aeronautical Industry Management;Zhengzhou Railway Vocational and Technical College;Kaifeng Gongyuan Road East Street Elementary School;
基金项目:Supported by the National Natural Sciences Youth Foundation(10901144)
摘    要:In this paper we consider a property of claw-free graphs.We show that if d(u)+ d(v)≥ν(G)+2k+3,for every two nonadjacent vertices u and v,then G is 2k-vertex-deletable IM-extendable,whereν(G)=|V(G)|.And the bound is tight.

关 键 词:IM-extendable  vertex-deletable  IM-extendable  claw-free  graph

A Property of Claw-free Graphs
LU Xiao-xu,LI Jing,WU Min.A Property of Claw-free Graphs[J].Chinese Quarterly Journal of Mathematics,2011(3):445-447.
Authors:LU Xiao-xu  LI Jing  WU Min
Institution:LU Xiao-xu1,LI Jing2,WU Min3 (1.Department of Mathematics and Physics,Zhengzhou Institute of Aeronautical Industry Management,Zhengzhou 450015,China,2.Zhengzhou Railway Vocational and Technical College,Zhengzhou 450052,3.Kaifeng Gongyuan Road East Street Elementary School,Kaifeng 475001,China)
Abstract:
Keywords:IM-extendable  vertex-deletable IM-extendable  claw-free graph  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号