在Moor-Shannon网络模型中,边连通度和限制边连通度较大的网络一般有较好的可靠性和容错性.本文证明:除两种平凡情形外,无向Kautz网络的拓扑结构,无向Kautz图UK(2,n)是超级限制边连通的.因此,它们比de Bruijn网络有更好的限制边连通性.For Moor-Shannon network models, those that have greater edge connectivity and restricted edge connectivity usually have better reliability and fault-tolerance. It is proved in this paper that undirected Kautz graphs UK(d,n), the topologies of undirected Kautz networks, are super restricted edge connected except for two trivial cases. And so, they have better restricted edge connectivity than undirected De Bruijn networks.国家自然科学基金(10271105,10371102);福建省青年科技人才创新基金(2003J036);教育厅基金(JA03147
设 G是一个阶不小于 6的 k正则连通点可迁图 .如果 G不含三角形 ,那么图 G是极大 3限制边连通的 ,或者 G含有各连通分支都同构于同一个 h阶点可迁图的 k- 1正则因子 ,其中2 k- 2≤...
AbstractThis work studies the super edge connectivity and super restricted edge connectivity of dire...
AbstractFor a connected graph G=(V,E), an edge set S⊂E is a k-restricted edge cut if G−S is disconne...
AbstractThe k-restricted edge connectivity is a more refined network reliability index than edge con...
AbstractAn edge cut of a connected graph is m-restricted if its removal leaves every component havin...
The restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of ...
A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. Th...
AbstractWe show that undirected Kautz graphs (Theorem 3.1) and modified Kautz graphs (Theorem 4.2) h...
Restricted edge connectivity is a more refined network reliability index than edge connectivity. A r...
Mass data processing and complex problem solving have higher and higher demands for performance of m...
"Discrete Mathemetics Top Cited Article 2005-2010"The restricted connectivity κ′(G)κ′(G) of a connec...
AbstractDe Bruijn and Kautz graphs have been intensively studied as perspective interconnection netw...
限制边割将连通图分离成不含孤立点的不连通图 ,如果最小限制边割只能分离孤立边 ,则称图G是超级限制边连通的 .证明了如果k >|G|/ 2 +1,那么k正则连通图G是超级限制边连通的 ,k的下界在一定...
Let G1 and G2 be two graphs. The Kronecker product G1 × G2 has vertex set V (G1 × G2) = V (G1) × V (...
AbstractThe restricted connectivity κ′(G) of a connected graph G is defined as the minimum cardinali...
设 G是一个阶不小于 6的 k正则连通点可迁图 .如果 G不含三角形 ,那么图 G是极大 3限制边连通的 ,或者 G含有各连通分支都同构于同一个 h阶点可迁图的 k- 1正则因子 ,其中2 k- 2≤...
AbstractThis work studies the super edge connectivity and super restricted edge connectivity of dire...
AbstractFor a connected graph G=(V,E), an edge set S⊂E is a k-restricted edge cut if G−S is disconne...
AbstractThe k-restricted edge connectivity is a more refined network reliability index than edge con...
AbstractAn edge cut of a connected graph is m-restricted if its removal leaves every component havin...
The restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of ...
A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. Th...
AbstractWe show that undirected Kautz graphs (Theorem 3.1) and modified Kautz graphs (Theorem 4.2) h...
Restricted edge connectivity is a more refined network reliability index than edge connectivity. A r...
Mass data processing and complex problem solving have higher and higher demands for performance of m...
"Discrete Mathemetics Top Cited Article 2005-2010"The restricted connectivity κ′(G)κ′(G) of a connec...
AbstractDe Bruijn and Kautz graphs have been intensively studied as perspective interconnection netw...
限制边割将连通图分离成不含孤立点的不连通图 ,如果最小限制边割只能分离孤立边 ,则称图G是超级限制边连通的 .证明了如果k >|G|/ 2 +1,那么k正则连通图G是超级限制边连通的 ,k的下界在一定...
Let G1 and G2 be two graphs. The Kronecker product G1 × G2 has vertex set V (G1 × G2) = V (G1) × V (...
AbstractThe restricted connectivity κ′(G) of a connected graph G is defined as the minimum cardinali...
设 G是一个阶不小于 6的 k正则连通点可迁图 .如果 G不含三角形 ,那么图 G是极大 3限制边连通的 ,或者 G含有各连通分支都同构于同一个 h阶点可迁图的 k- 1正则因子 ,其中2 k- 2≤...
AbstractThis work studies the super edge connectivity and super restricted edge connectivity of dire...
AbstractFor a connected graph G=(V,E), an edge set S⊂E is a k-restricted edge cut if G−S is disconne...