AbstractThe k-restricted edge connectivity is a more refined network reliability index than edge connectivity. In this paper, we study the undirected Kautz graph UK(d,n), an important model of networks, give an upper bound on the k-restricted edge connectivity of UK(d,n) for some small k and determine the 4-restricted edge connectivity of UK(2,n)
Restricted edge connectivity is a more refined network reliability index than edge connectivity. A r...
Given a graph G on n vertices with average degree d, form a random subgraph Gp by choosing each edge...
AbstractThe ith conditional edge-connectivity λi for a (simple) graph G is the minimum cardinality o...
AbstractAn edge cut of a connected graph is m-restricted if its removal leaves every component havin...
在Moor-Shannon网络模型中,边连通度和限制边连通度较大的网络一般有较好的可靠性和容错性.本文证明:除两种平凡情形外,无向Kautz网络的拓扑结构,无向Kautz图UK(2,n)是超级限制边连...
AbstractWe show that undirected Kautz graphs (Theorem 3.1) and modified Kautz graphs (Theorem 4.2) h...
International audienceThe k-restricted edge-connectivity of a graph G, denoted by λ k (G), is define...
The restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of ...
AbstractAn edge subset S of a connected graph G is a k-restricted edge cut if G-S is disconnected, a...
AbstractThis work deals with a generalization of the Cartesian product of graphs, the product graph ...
In this thesis, we will study the concept of k-edge connected and k-connected reliability. There, ve...
k-connectivity is an important measure of network robustness and resilience to random faults and dis...
A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. Th...
AbstractDe Bruijn and Kautz graphs have been intensively studied as perspective interconnection netw...
AbstractAn edge cut of a connected graph is 4-restricted if it disconnects this graph with each comp...
Restricted edge connectivity is a more refined network reliability index than edge connectivity. A r...
Given a graph G on n vertices with average degree d, form a random subgraph Gp by choosing each edge...
AbstractThe ith conditional edge-connectivity λi for a (simple) graph G is the minimum cardinality o...
AbstractAn edge cut of a connected graph is m-restricted if its removal leaves every component havin...
在Moor-Shannon网络模型中,边连通度和限制边连通度较大的网络一般有较好的可靠性和容错性.本文证明:除两种平凡情形外,无向Kautz网络的拓扑结构,无向Kautz图UK(2,n)是超级限制边连...
AbstractWe show that undirected Kautz graphs (Theorem 3.1) and modified Kautz graphs (Theorem 4.2) h...
International audienceThe k-restricted edge-connectivity of a graph G, denoted by λ k (G), is define...
The restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of ...
AbstractAn edge subset S of a connected graph G is a k-restricted edge cut if G-S is disconnected, a...
AbstractThis work deals with a generalization of the Cartesian product of graphs, the product graph ...
In this thesis, we will study the concept of k-edge connected and k-connected reliability. There, ve...
k-connectivity is an important measure of network robustness and resilience to random faults and dis...
A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. Th...
AbstractDe Bruijn and Kautz graphs have been intensively studied as perspective interconnection netw...
AbstractAn edge cut of a connected graph is 4-restricted if it disconnects this graph with each comp...
Restricted edge connectivity is a more refined network reliability index than edge connectivity. A r...
Given a graph G on n vertices with average degree d, form a random subgraph Gp by choosing each edge...
AbstractThe ith conditional edge-connectivity λi for a (simple) graph G is the minimum cardinality o...
DOI
Add to ORKG