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

有向循环图的强连通度的性质
引用本文:周永生,李唐芬.有向循环图的强连通度的性质[J].兰州理工大学学报,1991(3).
作者姓名:周永生  李唐芬
作者单位:甘肃工业大学基础课部 (周永生),甘肃工业大学基础课部(李唐芬)
摘    要:本文首先证明了连通有向循环图的k原子部分仍为连通有向循环图,并给出了有关连通有向循环图的强连通度的另一些性质。然后利用这些性质得到了基础图是简单图的连通有向循环图的强连通度的下界。

关 键 词:连通图    下界  k原子部分  点截集  强连通度

The Natures About Biconnectivity of Vectorai Connected Circular Diagraphs
Zhou Yongsheng,Li Tangfen.The Natures About Biconnectivity of Vectorai Connected Circular Diagraphs[J].Journal of Lanzhou University of Technology,1991(3).
Authors:Zhou Yongsheng  Li Tangfen
Institution:Division of Basic Courses
Abstract:It is proved in this paper that a k-atomic part of a vectorial connected circular diagraph is still a vectorial connected circular diagraph. Some other natures about biconnectivity of vectorial connected circular diagraphs are also given. Then by using these natures,the lower boundary of biconnectivity of vectorial connected circular diagraphs whose underlying graph is a simple graph is obtained.
Keywords:connected graph  arc  lower boundary  k-atomic part  vertex cut set  biconnectivity
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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