关于图的生成连通性的综述（英文）  

On the Spanning Connectivity of Graphs——A Survey

作　　者：依明江.沙比尔 尚辉 孟吉翔[1] Eminjan Sabir;SHANG Hui;MENG Jixiang(College of Mathematics and System Sciences,Xinjiang University,Urumqi Xinjiang 830046,China)

机构地区：[1]新疆大学数学与系统科学学院,新疆乌鲁木齐830046

出　　处：《新疆大学学报（自然科学版）》2018年第4期379-388,共10页Journal of Xinjiang University(Natural Science Edition)

基　　金：Project supported by the National Natural Science Foundation of China(11531011)

摘　　要：图G的生成连通度为最大的正整数k使得G的任意两个顶点之间存在i (1≤i≤k)条内部不交的路,并且这些路的并生成G.文章不仅涵盖了有关图的生成连通度的最新研究进展,还包含了图的生成连通度相关的超生成连通性、生成可系性、超生成可系性等问题的最新结果.除此之外,还讨论了一些值得进一步研究的问题.This is intended as a survey paper covering recent progresses in the filed of spanning connectivity,i.e.,the largest integer k such that a graph G contains i internally disjoint paths between any two distinct vertices of G for 1≤i≤k and the union of the i paths spans G.This paper also includes some results on related topics such as super spanning connectivity,spanning laceability,super spanning laceability of graphs and digraphs,as well as some research works in the future.

关 键 词：连通性 哈密顿性 生成连通性 互联网络 

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