完全二部图的强子图连通度  

Strong Subgraph Connectivity on Complete Bipartite Digraphs

作　　者：程睿 

机构地区：[1]绍兴文理学院数理信息学院,浙江 绍兴

出　　处：《应用数学进展》2022年第6期3646-3650,共5页Advances in Applied Mathematics

摘　　要：无向图G的广义k-连通度是在1985年由Hager引入的定义,这个概念后来又被人们推广到有向图中并提出了强子图k-连通度的定义。近年来,强子图k-连通度的研究在有向图上取得很多重要结果。在本文中,我们研究并给出了完全二部有向图上的强子图k-连通度的若干结果。The definition of generalized connectivity of undirected graph G was introduced by Hager in 1985. This concept was extended to directed graph and the definition of strong subgraph k-connectivity was proposed. In recent years, the study of strong subgraph k-connectivity has achieved many im-portant results on directed graphs. In this paper, we study this concept and give some results on the strong subgraph k-connectivity on complete bipartite digraphs.

关 键 词：广义连通度 强子图k-连通度 完全二部图 

分 类 号：O157.5[理学—数学]