Edge-disjoint paths in faulty augmented cubes

Author: cvci

August undefined, 2024

WebJul 31, 2024 · It is clear that there are only two edge-disjoint paths: ... -> E -> F -> t; I am guessing you need to use a modified version of the Ford-Fulkerson algorithm that keeps track of the augmented paths. But how does it override previous erroneous paths (like s -> A -> E -> F -> t in my example). algorithm; graph-theory; directed-graph; graph-traversal;

Embedding meshes/tori in faulty crossed cubes - ScienceDirect

WebAug 9, 2024 · The n-dimensional crossed cube CQ n, a variation of the hypercube Q n, has the same number of vertices and the same number of edges as Q n, but it has only about half of the diameter of Q n.In the interconnection network, some efficient communication algorithms can be designed based on edge-disjoint Hamiltonian cycles. In addition, two … WebA graph G is called strongly Menger edge connected (SM-λ for short) if the number of disjoint paths between any two of its vertices equals the minimum degree of these two vertices. In this paper, we focus on the maximally edge-fault-tolerant of the class of BC-networks (contain hypercubes, twisted cubes, Möbius cubes, crossed cubes, etc ... downwind direction

Strong Menger connectedness of augmented $k$-ary $n$-cubes

WebOct 2, 2024 · A connected graph is called strongly Menger (edge) connected if for any two distinct vertices of , there are vertex (edge)-disjoint paths between and . In this paper, we consider strong Menger (edge) connectedness of the augmented -ary -cube , which is a variant of -ary -cube . By exploring the topological proprieties of , we show that for ... http://www.iaeng.org/IJCS/issues_v39/issue_1/IJCS_39_1_05.pdf WebMay 1, 2024 · It is known that edge disjoint paths is closely related to the edge connectivity and the multicommodity flow problems. In this paper, we study the edge disjoint paths … downwind cruiser sup

Edge-disjoint paths in faulty augmented cubes Request …

WebJul 7, 2024 · Abstract: It is common knowledge that edge disjoint paths have close relationship with the edge connectivity. Motivated by the well-known Menger theorem, … WebMa and Yu [12] studied edge-disjoint paths embedding in the augmented cube with faulty edges. Xu and Li [23] investigated edge-disjoint paths embedding in the regular graph … cleaning eufy filterWebFeb 28, 2024 · The first constructs three Edge-Disjoint Node-Independent Spanning Trees (EDNISTs), whereas the second constructs six ISTs but not edge disjoint. ... where P is the routing path. The experimental results measure the maximum and the average of all maximum number of communication steps between the root node and all other nodes … cleaning eureka tents

"Web7 rows · May 15, 2024 · The main results are given in Sections 3 Edge-disjoint paths in, 4 Extra edge-connectivity of. ... " - Edge-disjoint paths in faulty augmented cubes

Edge-disjoint paths in faulty augmented cubes

WebMa and J. Yu, Edge-disjoint paths in faulty augmented cubes, Discr. Appl. Math. 294 (2024) 108–114. ... Qiao and W. Yang, Edge disjoint paths in hypercubes and folded hypercubes with conditional faults, Discr. Appl. Math. 294 … WebJul 7, 2024 · Abstract: It is common knowledge that edge disjoint paths have close relationship with the edge connectivity. Motivated by the well-known Menger theorem, we find that the maximum cardinality of edge disjoint paths connecting any two disjoint connected subgraphs with g vertices in G can also define by the minimum modified edge …

Did you know?

WebStrong Menger connectedness of augmented k-ary n-cubes Mei-Mei Gu 1;2 Jou-Ming Chang3y Rong-Xia Hao z 1 Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P.R. China 2 Faculty of Mathematics and Physics, Charles University, Prague 11800, Czech Republic 3 Institute of Information and Decision Sciences, National Taipei … WebSep 25, 2024 · Ma and Yu studied edge-disjoint paths embedding in the augmented cube with faulty edges. Xu and Li [ 23 ] investigated edge-disjoint paths embedding in the regular graph with faulty edges. With the development of technology, networks and subnetworks of massive scales are made into chips [ 1 ].

WebMany-to-Many Disjoint Paths in Augmented Cubes With Exponential Fault Edges Mingzu Zhang, Wenhuan Ma, Tianlong Ma; Affiliations Mingzu Zhang ORCiD College of Mathematics and System Sciences, Xinjiang University, Urumqi, China ... It is common knowledge that edge disjoint paths have close relationship with the edge connectivity. … WebFAWN CREEK CEMETERY . NAME: BIRTH DATE. DEATH DATE. OBIT. Abraham, Emma D. February 19, 1910. December 30, 2000

WebThe n-dimensional augmented cube, denoted by AQn, an important variation of the hypercube, possesses. The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional augmented cube, denoted by AQn, an important variation of the … WebSep 25, 2024 · Ma and Yu studied edge-disjoint paths embedding in the augmented cube with faulty edges. Xu and Li [ 23 ] investigated edge-disjoint paths embedding in the …

WebJun 16, 2024 · Let T1, T2,.... Tk be spanning trees in a graph G. If for any pair of vertices u and v of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common …

WebThe crossed cube is an important variant of the hypercube which is the most popular interconnection network for parallel processing. This paper is concerned with the problem of embedding meshes/tori in faulty crossed cubes. We reduce this mesh/tori embedding problem to the problem of embedding paths/cycles in faulty crossed cubes. downwind distance meaningWebﬁrst prove that the augmented cube AQn contains two edge-disjoint Hamiltonian cycles for n 3. We then prove that AQn, with n 2, is two-equal path coverable. Based on the … downwind dockside servicesWebﬁrst prove that the augmented cube AQn contains two edge-disjoint Hamiltonian cycles for n 3. We then prove that AQn, with n 2, is two-equal path coverable. Based on the proofs of existences, we further present linear time algorithms to construct two edge-disjoint Hamiltonian cycles and two-equal path cover in an n-dimensional augmented cube ... cleaning evaporative cooler motor overheatingWebBartlesville Urgent Care. 3. Urgent Care. “I'm wondering what the point of having an urgent care is if it's not open in the evening.” more. 3. Ascension St. John Clinic Urgent Care - … downwind duct sanitationWebWe point out an unconsidered case in the proof for Theorem 3 in [4] and provide the proof for that case. To this end, a new property of n -hypercube is observed and made use of. downwind distanceWebThe edge-disjoint paths relate closely with the edge connectivity. In this paper, we discuss the edge-fault-tolerant ... the augmented cubes AQ n, the bubble-sort star graph BS n, the folded hypercube FQ n, the hypercube Q ... n has (n 3) faulty edges, B n is edge-fault-tolerant strongly Menger edge connected for n 3. (3) Using the inductive ... cleaning evaporative coolerWebJan 31, 2024 · There can be maximum two edge disjoint paths from source 0 to destination 7 in the above graph. Two edge disjoint paths are highlighted below in red and blue colors are 0-2-6-7 and 0-3-6-5-7. Note … cleaning evaporator coil in attic