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

蛛网图的连通包数
引用本文:郭梦夏,邓天炎,金剑行,惠志昊.蛛网图的连通包数[J].广西师院学报,2013(4):28-31.
作者姓名:郭梦夏  邓天炎  金剑行  惠志昊
作者单位:[1]广西师范学院数学科学学院,广西南宁530023 [2]平顶山学院数学与信息科学学院,河南平顶山467000
摘    要:证明了蛛网图W (m ,n)的连通包数为hc (W (m ,n))= m+2 n -1.通过对蛛网图进行简化处理,即将蛛网图W (m ,n)的叶子顶点去掉,得到图G的连通包数为hc (G)=┌n2┐+ m .

关 键 词:测地线  连通包数  蛛网图

The Connected Hull Number of Spider-Web Graphs
GUO Mengxia,DENG Tianyan,JIN Jianxing,HUI Zhihao.The Connected Hull Number of Spider-Web Graphs[J].Journal of Guangxi Teachers College(Natural Science Edition),2013(4):28-31.
Authors:GUO Mengxia  DENG Tianyan  JIN Jianxing  HUI Zhihao
Institution:1. School of Mathematical and Sciences, Guangxi Teachers Education University, Nanning 530023, China; 2.College of Mathematics and Information Sciences, Pingdingshan University, Pingdingshan 467000, China)
Abstract:In this paper ,we prove the connected hull number of Spider-Web graphs W (m ,n) is hc (W (m ,n))= m+2n-1 ,and if the Spider-Web graphs W (m ,n)(n≥3) have no leaf vertex ,the connected hull number of G is hc (G )=┌n2┐+ m .
Keywords:u -v geodesic  connected hull number  Spider-Web graph
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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