检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Ganghua Xie Yinkui Li Ganghua Xie;Yinkui Li(Department of Mathematics, Qinghai Nationalities University, Xining, China)
机构地区:[1]Department of Mathematics, Qinghai Nationalities University, Xining, China
出 处:《Open Journal of Applied Sciences》2023年第12期2421-2430,共10页应用科学(英文)
摘 要:In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CK<sub>g</sub> (G) to measure the fault tolerance of networks. In this paper, we determine the g-component connectivity of some graphs, such as fan graph, helm graph, crown graph, Gear graph and the Mycielskian graph of star graph and complete bipartite graph.In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CK<sub>g</sub> (G) to measure the fault tolerance of networks. In this paper, we determine the g-component connectivity of some graphs, such as fan graph, helm graph, crown graph, Gear graph and the Mycielskian graph of star graph and complete bipartite graph.
关 键 词:g-Component Connectivity Mycielskian Graph The Fault Tolerance of Networks
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.61