VERTEX-CONNECTIVITY

作品数：3被引量：3H指数：1
导出分析报告
相关领域：理学更多>>
相关期刊：《Progress in Natural Science:Materials International》《新疆大学学报（自然科学版中英文）》《Acta Mathematica Sinica,English Series》更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-3
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Reciprocal Distance Laplacian Eigenvalue Distribution Based on Graph Parameters
《新疆大学学报（自然科学版中英文）》2024年第5期562-570,共9页CUI Jiaxin MA Xiaoling 
supported by the Natural Science Foundation of Xinjiang Uygur Autonomous Region of China“Graph problems of topological parameters based on the spectra of graph matrices”(2021D01C069);the National Natural Science Foundation of the People's Republic of China“The investigation of spectral properties of graph operations and their related problems”(12161085)。
Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I ...
关键词：reciprocal distance Laplacian eigenvalue VERTEX-CONNECTIVITY independence number pendant vertices 
On Eccentric Connectivity Index and Connectivity
《Acta Mathematica Sinica,English Series》2019年第7期1205-1216,共12页Vivian MUKUNGUNUGWA Simon MUKWEMBI 
Let G be a finite connected graph. The eccentric connectivity index ξ^c(G) of G is defined as ξ^c(G)=∑v∈V(G)ec(υ)deg(υ), where ec(v) and deg(υ) denote the eccentricity and degree of a vertex v in G, respectivel...
关键词：EXTREMAL GRAPH order DIAMETER VERTEX-CONNECTIVITY EDGE-CONNECTIVITY 
K-vertex-connectivity minimum augmentation for undirected unweighted graphs被引量：3
《Progress in Natural Science:Materials International》2003年第6期434-445,共12页CAO Qiguo, WU Xue and SUN Yugeng(School of Electrical Automation and Energy Engineering, Tianjin University, Tianjin 300072, China) 
the Education Ministry Doctoral Discipline Foundation of China (Grant No.2000005634)
For an undirected unweighted graph G0=( V0, E0) and a positive integer K, the K-vertex-connectivity minimum augmentation problem ( K-VCMAP) is to find a minimum set of edges Emin such that the graph H0 = ( V0, E0 U∪ ...
关键词：K-vertex-connectivity minimum extended augmentation admissible lifting KR-arc-connected graphs flaw-linkers. 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部