检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Mathematical Sciences, Xiamen University, Xiamen 361005 [2]Institute of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007, China [3]School of Mathematical Sciences, Xiamen University, Xiamen 361005, China.
出 处:《Journal of Systems Science & Complexity》2005年第4期564-569,共6页系统科学与复杂性学报(英文版)
基 金:This research is supported by the National Natural Science Foundation of China.
摘 要:A. Kaneko and K. Ota proved that for a minimally (n, λ)-connected graph G, if |G| = p ≥ 3n - 1, then e(G) ≤ nλ(|G| - n); and if e(G) = nλ(|G| - n), then G is isomorphic to the graph Kn^λ,p-n which is obtained from the complete bipartite graph Kn,p-n by replacing each edge with A multiple edges; if 3n - 1 ≥ |G}≥ n + 1, then e(G) ≤λ(|G| + n)^2/8. In this paper, we determine all the minimally (n, λ)-connected graphs with order p and the maximum size λ(p+n)^2/8 for 3n- 1 ≥ p ≥ n+ 1 for 3n-1≥p≥n+1.
关 键 词:(n λ )-connectivity minimally (n λ )-connected graph minimally k-connected graph.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.179