未找到相关数据
PROOF OF SLATER'S CONJECTURE ON k-CRITICAL n-CONNECTED GRAPHS
被引：1
作者：
苏健基
机构：
[1] Guangxi Normal Unioersity
[2] Department of Mathematics
[3] Guilin
来源：
关键词：
graph;
critical;
connectivity;
fragment;
end;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A graph G is called k-critically n-connected or simply (n, k)-graph, (n≥k≥1), if for all V′(?)V(G) with |V′|≤k, we have k(G-V′)=n-|V′|, where k(G) denotes the connectivity of G. This notion is introduced by Maurer and Slater in [1]. The following conjecture on a (n, k)-graph is proposed.
引用
收藏
页码：1675 / 1678
页数：4
相关论文