site stats

Component edge connectivity of pancake graphs

WebMar 24, 2024 · The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In … WebJul 1, 2015 · The super edge-connectivity λ′ of a connected graph G is the minimum cardinality of an edge-cut F in G such that every component of G − F contains at least two vertices.

Strong Menger Connectedness of Augmented k-ary n-cubes

WebJan 1, 2024 · Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. Mei-Mei Gu, Rongxia Hao, Shyue-Ming Tang, Jou-Ming Chang; Mathematics. Discret. Appl. ... the upper bound of the-component (edge) connectivity of BH_n is obtained and the two kinds of connectivities can help to measure the robustness … WebSep 6, 2024 · In this paper, we determine the cyclic vertex (edge) connectivity of the burnt pancake graphs [Formula: see text] which is the Cayley graph of the group of … top rated glock 9mm https://ohiodronellc.com

Fault-Tolerant Routing of Generalized Hypercubes under 3-Component …

WebMar 30, 2024 · Neighbor connectivity of pancake graphs and burnt pancake graphs. Discret. Appl. Math. 324: 46-57 (2024) [j32] view. electronic edition via DOI; ... Relationship between extra edge connectivity and component edge connectivity for regular graphs. Theor. Comput. Sci. 833: 41-55 (2024) 2010 – 2024. WebNetworks are usually modeled as graphs, and the edge-connectivity is a classic measurement for the fault tolerance of the graph. In general, the larger the edge … WebWe propose the complete cubic network structure to extend the existing class of hierarchical cubic networks, and establish a general connectivity result which states that the surviving graph of a complete cubic network, when a linear number of vertices are removed, consists of a large (connected) component and a number of smaller components which … top rated glock slides

Note on Applications of Linearly Many Faults Request PDF

Category:arXiv:2105.04803v1 [math.CO] 11 May 2024

Tags:Component edge connectivity of pancake graphs

Component edge connectivity of pancake graphs

The a -average Degree Edge-Connectivity of Bijective

WebJan 17, 2024 · The l-component (edge) connectivity of a graph G, denoted by cκ l (G) (cλ l (G)), is the minimum number of vertices (edges) whose removal from G results in a … WebMay 1, 2024 · In this paper we present two families of graphs similar with the networks proposed by Chen et al. [Y.C. Chen, J.J.M. Tan, L.H. Hsu, S.S. Kao, Super-connectivity and super edge-connectivity for ...

Component edge connectivity of pancake graphs

Did you know?

WebSep 15, 2024 · The burnt pancake graph BP n [23] and the godan graph EA n [24, 25] are two kinds of Cayley graphs, each of which is regular, vertex-transitive and used to design various commercial multiprocessor ... WebJan 3, 2024 · The substructure connectivity of a graph G, denoted by κs(G; H), is the minimum cardinality of a set of connected subgraphs in G, whose deletion disconnects the graph G and every element in the ...

WebApr 20, 2024 · The extra edge connectivity and component edge connectivity are two parameters for the reliability evaluation. ... networks, burnt pancake graphs, (n,k)-star graphs, etc. ... between the graph’s ... WebThe k-component edge connectivity \(c\lambda _{k}(G)\) of a non-complete graph G is the minimum number of edges whose deletion results in a graph with at least k components.

WebJun 1, 2024 · Given a connected graph G and a non-negative integer g, the g-extra connectivity (resp. g-extra edge-connectivity) of G, denoted by κg(G) (resp. λg(G)), is the minimal cardinality of a set of ... WebJun 12, 2024 · Given a simple connected graph G, let κ(n) [λ(n)] be the minimum cardinality of a set of vertices [edges], if any, whose deletion disconnects G and every remaining component has more than n ...

Webgraph with at least lcomponents. The pancake graph P n is a popular underlying topology for distributed systems. In the paper, we determine the cκ l(P n)and cλ l(P n)for 3 ≤l≤5. …

WebSep 1, 2024 · Component (edge) connectivity is a generalization of traditional (edge) connectivity. ... data center networks, augmented k-ary n-cubes, hierarchical star networks, burnt pancake graphs, (n,k ... top rated gloves for winterWebMay 9, 2024 · The g(g≥0)-extra edge-connectivity of the connected graph G, denoted by λg(G), is the minimal cardinality of a set of edges of G, if exists, whose deletion disconnects G and each remaining ... top rated glucosamine sulfateWebThe burnt pancake graph BP n [23] and the godan graph EA n [24, 25] are two kinds of Cayley graphs, each of which is regular, vertex-transitive and used to design various commercial multiprocessor ... top rated glovesWebAbstract. The cyclic vertex (resp., edge) connectivity of a graph G, denoted by κ c ( G) (resp., λ c ( G) ), is the minimum number of vertices (resp., edges) whose removal from … top rated gloves for menWebg(G) and g-component edge connectivity c g(G) of the graph G. A g-component (edge) cut of a non-complete Gis a vertex (edge) set to be deleted from the graph Gsuch that … top rated glucose monitoring appWebThe two parameters naturally generalize the classical connectivity and edge connectivity of graphs defined in term of the minimum vertex-cut and the minimum edge-cut, … top rated gloves for poison ivyWebMar 1, 2009 · The Spanning Connectivity of the Burnt Pancake Graphs. Let u and v be any two distinct vertices of an undirected graph G, which is k-connected. For 1 ≤ w ≤ k, a … top rated gloves for speed bag