| 定向图连通度的下界 |
| |
| 引用本文： | 杨开云,王世英. 定向图连通度的下界[J]. 太原师范学院学报(自然科学版), 2008, 7(2): 9-12 |
| |
| 作者姓名： | 杨开云 王世英 |
| |
| 作者单位： | 山西大学数学科学学院,山西,太原,030006 |
| |
| 基金项目： | 山西省自然科学基金资助项目 |
| |
| 摘 要： | 有向图和二部有向图连通度的下界已由Hellwing和Volkmann给出.定向图是没有二圈的有向图.文章研究了这类特殊的有向图-定向图,同时通过改进Hellwing等人的证明方法,得到了定向图和二部定向图连通度的更好的下界.
|
| 关 键 词： | 定向图 连通度 度序列 |
Lower Bounds on the Vertex-Connectivity of Oriented Graphs |
| |
| Yang Kaiyun,Wang Shiying. Lower Bounds on the Vertex-Connectivity of Oriented Graphs[J]. Journal of Taiyuan Normal University:Natural Science Edition, 2008, 7(2): 9-12 |
| |
| Authors: | Yang Kaiyun Wang Shiying |
| |
| Affiliation: | Yang Kaiyun Wang Shiying (School of Mathematical Science ,Shanxi University ,Taiyuan 030006,China) |
| |
| Abstract: | Lower bounds on the verte given by Hellwing and Volkmann. A digraph graph. The particularly kind of diraph-ori x-connectivity of digraphs and bipartite digraphs are without and cycle of length two is called an oriented ented graph is studied and Hellwing and other＇s methords of proof are improved,the more precise vertex-connectivities of oriented graphs and bipartite oriented graphs are obtained. |
| |
| Keywords: | oriented graph connectivity degree sequence |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
