云南高校图书馆联盟文献共享服务平台- CONNECTIVITY

CONNECTIVITY: 作品数：804被引量：884H指数：10; 导出分析报告; 相关领域：自动化与计算机技术更多>>; 相关作者：陈永光王桂平杨光丛日杰单祥茹更多>>; 相关机构：东南大学《汽车制造业》编辑部上海交通大学东北林业大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划中国博士后科学基金国家教育部博士点基金更多>>

The super-connectivity of graphs with two orbits: 《Applied Mathematics(A Journal of Chinese Universities)》2024年第4期571-583,共13页CHEN Lai-huan MENG Ji-xiang YANG Wei-hua LIU Feng-xia; Supported by the National Natural Science Foundation of Xinjiang(2020D04046);the National Natural Science Foundation of Shanxi(20210302123097);the National Natural Science Foundation of China(12371356,11961067).; A graph G is said to be super-connected or simply super-κ, if each minimum vertex cut of G isolates a vertex. A graph G is said to be a k-vertex-orbit graph if there are k vertex orbits when Aut(G) acts on V(G). A gr...; 关键词：super-connectivity superatom edge orbit

On Spanning Wide Diameter of Graphs: 《新疆大学学报（自然科学版中英文）》2024年第5期571-578,590,共9页WANG Yameng YIMINGJIANG Shabier; supported by the National Natural Science Foundation of the People's Republic of China“On disjoint path covers of graphs and related problems”(12261085);Natural Science Foundation of Xinjiang Uygur Autonomous Region of China“On spanning wide diameter and spanning cycle ability of interconnection networks”(2021D01C116)。; A t-container Ct(u,v)is a set of t internally disjoint paths between two distinct vertices u and v in a graph G,i.e.,Ct(u,v)={P_(1),P_(2),···,Pt}.Moreover,if V(P_(1))∪V(P_(2))∪···∪V(Pt)=V(G)then Ct(u,v)is cal...; 关键词：CONNECTIVITY spanning connectivity spanning laceability wide diameter spanning wide diameter

The Q-index and Connectivity of Graphs: 《Journal of the Operations Research Society of China》2024年第2期505-519,共15页Peng-Li Zhang Li-Hua Feng Wei-Jun Liu Xiao-Dong Zhang; the National Natural Science Foundation of China(Nos.11971311,12161141003,and 12026230);Science and Technology Commission of Shanghai Municipality(No.22JC1403600);Li-Hua Feng and Wei-Jun Liu are partly supported by the National Natural Science Foundation of China(Nos.11871479,12071484);Hunan Provincial Natural Science Foundation(Nos.2020JJ4675,2018JJ2479).; A connected graph G is said to be k-connected if it has more than k vertices and remains connected whenever fewer than k vertices are deleted.In this paper,for a connected graph G with sufficiently large order,we pres...; 关键词：Q-index Minimum degree k-connected

Improving landscape connectivity through habitat restoration:application for Asian elephant conservation in Xishuangbanna Prefecture,China被引量：1: 《Integrative Zoology》2024年第2期319-335,共17页Bin WAN Wenwen LI Peng LIU Nian YANG Shang CHEN Xianming GUO Bin WANG Li ZHANG; We are grateful for the financial support of the National Key Research and Development Program of China(2016YFC0503200);the National Nature Science Foundation of China(31570408 and 31801986);the China Postdoctoral Science Foundation(2018M631372).; Habitat restoration is an effective method for improving landscape connectivity,which can reduce habitat fragmentation.Maintaining landscape connectivity could promote connections between habitat,which is extremely es...; 关键词：Asian elephant CONNECTIVITY habitat restoration habitat suitability landscape graphs

Residual Closeness of Graphs with Given Parameters: 《Journal of the Operations Research Society of China》2023年第4期839-856,共18页Mei-Qun Cheng Bo Zhou; supported by the National Natural Science Foundation of China(No.12071158).; Robustness of the network topology is a key aspect in the design of computer networks. Residual closeness is a new graph-theoretic concept defined as a measure of network robustness due to the failure of individual ve...; 关键词：Residual closeness CONNECTIVITY Edge connectivity Bipartiteness

Z3-CONNECTIVITY OF 4-EDGE-CONNECTED TRIANGULAR GRAPHS: 《Annals of Applied Mathematics》2017年第4期428-438,共11页Chuixiang Zhou; supported by JK2015004; A graph G is k-triangular if each of its edge is contained in at least k triangles. It is conjectured that every 4-edge-connected triangular graph admits a nowhere-zero 3-flow. A triangle-path in a graph G is a sequen...; 关键词：Z3-connected nowhere-zero 3-flow triangular graphs

Conditional Connectivity of Bubble Sort Graphs: 《Acta Mathematicae Applicatae Sinica》2017年第4期933-944,共12页Ling-sheng SHI Peng WU; Supported by Tsinghua University Initiative Scientific Research Program and Project 11771246; Supported by National Natural Science Foundation of China; A subset F V（G） is called an Rk-vertex-cut of a graph G if G - F is disconnected and each vertex of G - F has at least k neighbors in G - F. The Rk-vertex-connectivity of G, denoted by κk（G）, is the cardinality ...; 关键词：bubble sort graph CONNECTIVITY CUT

New Bounds on Tenacity of Graphs with Small Genus: 《Open Journal of Discrete Mathematics》2014年第2期28-35,共8页Davoud Jelodar Dara Moazzami; A new lower bound on the tenacity ?of a graph G in terms of its connectivity and genus is obtained. The lower bound and interrelationship involving tenacity and other well-known graphical parameters are considered, an...; 关键词：TENACITY Parameter CONNECTIVITY GENUS Planar GRAPH TORUS

On Eccentric Connectivity Index and Polynomial of Thorn Graph被引量：1: 《Applied Mathematics》2012年第8期931-934,共4页Nilanjan De; The eccentric connectivity index based on degree and eccentricity of the vertices of a graph is a widely used graph invariant in mathematics. In this paper we present the explicit generalized expressions for the eccen...; 关键词：Ecentricity ECCENTRIC CONNECTIVITY Index ECCENTRIC CONNECTIVITY POLYNOMIAL THORN GRAPHS

Connectivity and Transportation Description of Graphs: 《通讯和计算机（中英文版）》2012年第4期481-488,共8页Priesler （Moreno） Miri Reichman Arie; 关键词：连接交通图卫星系统图形描述中央控制器分发系统最短路径图形理论

CONNECTIVITY