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

检索规则说明：AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：范例一： (K=图书馆学 OR K=情报学) AND A=范并思　　　　范例二：J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual

全部期刊核心期刊 EI来源期刊 SCI来源期刊 CA来源期刊 CSCD来源期刊 CSSCI来源期刊

On the Sizes of k-edge-maximal r-uniform Hypergraphs: 《Acta Mathematicae Applicatae Sinica》2022年第3期532-539,共8页Ying-zhi TIAN Hong-Jian LAI Ji-xiang MENG Li-qiong XU; supported by the National Natural Science Foundation of China(Nos.11861066,11531011);Tianshan Youth Project of Xinjiang(2018Q066)。; Let H=(V,E)be a hypergraph,where V is a set of vertices and E is a set of non-empty subsets of V called edges.If all edges of H have the same cardinality r,then H is an r-uniform hypergraph;if E consists of all r-subs...; 关键词：EDGE-CONNECTIVITY k-edge-maximal hypergraphs r-uniform hypergraphs

Bounds for the Rainbow Disconnection Numbers of Graphs: 《Acta Mathematica Sinica,English Series》2022年第2期384-396,共13页Xu Qing BAI Zhong HUANG Xue Liang LI; Supported by National Natural Science Foundation of China(Grant No.11871034)。; An edge-cut of an edge-colored connected graph is called a rainbow cut if no two edges in the edge-cut are colored the same.An edge-colored graph is rainbow disconnected if for any two distinct vertices u and v of the...; 关键词：EDGE-COLORING EDGE-CONNECTIVITY rainbow disconnection coloring(number) line graph

Sufficient Conditions for Maximally Edge-Connected Hypergraphs: 《Journal of the Operations Research Society of China》2021年第1期119-129,共11页Lin-Ken Tong Er-Fang Shan; This research was partially supported by the National Natural Science Foundation of China(Nos.11571222 and 11871329).; The edge-connectivity of a graph or a hypergraph is defined as the minimum number of edges whose removal renders the graph or hypergraph disconnected.A graph or hypergraph is called maximally edge-connected if the edg...; 关键词：Hypergraph EDGE-CONNECTIVITY Maximally edge-connected

Super-Edge-Connectivity and Zeroth-Order Randi´c Index: 《Journal of the Operations Research Society of China》2019年第4期615-628,共14页Zhi-Hong He Mei Lu; This work is supported by the National Natural Science Foundation of China(Nos.11501490,61373019,13071107);the Natural Science Foundation of Shandong Province(No.ZR2015AM006).; Define the zeroth-order Randic index R^(0)(G)=∑x∈V(G)1/√dG1(x),where dG(x)denotes the degree of the vertex x.In this paper,we present two sufficient conditions for graphs and triangle-free graphs to be super-edge-c...; 关键词：Zeroth-order Randic index Super-edge-connected DEGREE Triangle-free graph Minimum degree

Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size: 《Acta Mathematica Sinica,English Series》2019年第12期1861-1870,共10页Sebastian MILZ Lutz VOLKMANN; Let D be a finite and simple digraph with vertex set V(D).The minimum degreeδof a digraph D is defined as the minimum value of its out-degrees and its in-degrees.If D is a digraph with minimum degreeδand edge-connec...; 关键词：DIGRAPHS EDGE-CONNECTIVITY MAXIMALLY edge-connected DIGRAPHS super-edge-connected DIGRAPHS

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

Super Edge-connectivity and Zeroth-order General Randi Index for -1≤α< 0被引量：1: 《Acta Mathematicae Applicatae Sinica》2018年第4期659-668,共10页Zhi-hong HE Mei LU; supported by the National Natural Science Foundation of China(No.11501490,61373019,11371307);by the Natural Science Foundation of Shandong Province(No.ZR2015AM006); Let G be a connected graph with order n,minimum degree δ = δ（G） and edge-connectivity λ =λ（G）. A graph G is maximally edge-connected if λ = δ, and super edge-connected if every minimum edgecut consists of ed...; 关键词：Zeroth-order general Randie index super edge-connected DEGREE triangle-free graph minimumdegree

On the extra edge-connectivity of hypercubes被引量：1: 《Applied Mathematics(A Journal of Chinese Universities)》2016年第2期198-204,共7页ZHANG Ming-zu MENG Ji-xiang YANG Wei-hua; Supported by the National Natural Science Foundation of China(11171283,11471273,11461038,11301440);Natural Sciences Foundation of Shanxi Province(2014021010-2); The classical hypercube structure is a popular topological architecture in parallel computing environments and a large number of variations based on the hypercube were posed in the past three decades. Reliability eval...; 关键词：Edge fault tolerance Extra edge-connectivity HYPERCUBE

Super-Edge-Connectivity of G(k,d,s)(s≥k/2): 《Wuhan University Journal of Natural Sciences》2014年第3期189-192,共4页YANG Zhaolan HUANG Shihua YANG Rong; A graph G is super-edge-connected,for short super-λ,if every minimum edge-cut consists of edges adjacent to a vertex of minimum degree.Alphabet overlap graph G（k,d,s）is undirected,simple graph with vertex set V={v...; 关键词：alphabet overlap digraph de Bruijn graph alphabet overlap graph diameter girth edge connectivity super-λ

Super Cyclically Edge-connected Vertex-transitive Graphs of Girth at Least 5: 《Acta Mathematica Sinica,English Series》2013年第8期1569-1580,共12页Jin Xin ZHOU Yan Tao LI; supported by National Natural Science Foundation of China (Grant No.11271012);the Fundamental Research Funds for the Central Universities (Grant Nos.2011JBM127,2011JBZ012);supported by National Natural Science Foundation of China (Grant No.11101035);the Subsidy for Outstanding People of Beijing (Grant No.2011D005022000005); A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-...; 关键词：Cyclic edge-cut cyclic edge-connectivity super cyclically edge-connected vertex-transit-ive graphs

EDGE-CONNECTIVITY