3-extra connectivity of 3-ary n-cube networks

DOI10.1016/J.IPL.2014.04.003MaRDI QIDQ2448858zbMATH OpenOpenAlexFDO

Authors Mei-Mei Gu, Rong-Xia Hao

Publication date 5 May 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.5083

zbMATH Keywords

3-ary \(n\)-cubesextra connectivityfault toleranceinterconnection networks

Mathematics Subject Classification ID

Connectivity (05C40) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Abstract: Let G be a connected graph and S be a set of vertices. The h-extra connectivity of G is the cardinality of a minimum set S such that G-S is disconnected and each component of G-S has at least h+1 vertices. The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The h-extra connectivity for h=1,2 of k-ary n-cube are gotten by Hsieh et al. in [Theoretical Computer Science, 443 (2012) 63-69] for k>=4 and Zhu et al. in [Theory of Computing Systems, arxiv.org/pdf/1105.0991v1 [cs.DM] 5 May 2011] for k=3. In this paper, we show that the h-extra connectivity of the 3-ary n-cube networks for h=3 is equal to 8n-12, where n>=3.

Recommendations

• On the extraconnectivity of \(k\)-ary \(n\)-cube networks
• Extraconnectivity of k-ary n-cube networks
• The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes
• On the 3-Extra Connectivity of Enhanced Hypercubes
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks

Cites work

• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• 3-extra connectivity of Cayley graphs generated by transposition generating trees
• Characterizing a kind of fault tolerance of alternating group network
• Conditional Diagnosability of Alternating Group Graphs
• Conditional edge-fault pancyclicity of augmented cubes
• Extraconnectivity of k-ary n-cube networks
• Extraconnectivity of \(s\)-geodetic digraphs and graphs
• Extraconnectivity of graphs with large girth
• Extraconnectivity of hypercubes
• Graph theory
• Lee distance and topological properties of k-ary n-cubes
• On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
• On the extraconnectivity of graphs

Cited in

(32)

• Parallel routing in regular networks with faults
• Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
• Embedded connectivity of ternary \(n\)-cubes
• Neighbor connectivity of \(k\)-ary \(n\)-cubes
• The largest component of faulty star graphs
• Structure connectivity and substructure connectivity of wheel networks
• Reliability measure of multiprocessor system based on enhanced hypercubes
• Structure connectivity and substructure connectivity of bubble-sort star graph networks
• The extra connectivity and extra diagnosability of regular interconnection networks
• The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes
• The \(g\)-extra connectivity and diagnosability of crossed cubes
• Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
• Path and cycle fault tolerance of bubble-sort graph networks
• Fault tolerance of augmented cubes
• Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
• Connectivity and super connectivity of the exchanged 3-ary \(n\)-cube
• Note on reliability of star graphs
• The 3-path-connectivity of the \(k\)-ary \(n\)-cube
• The extra connectivity of bubble-sort star graphs
• Extraconnectivity of k-ary n-cube networks
• The g-extra conditional diagnosability of graphs in terms of g-extra connectivity
• On the 3-Extra Connectivity of Enhanced Hypercubes
• On the extraconnectivity of \(k\)-ary \(n\)-cube networks
• On extra connectivity and extra edge-connectivity of balanced hypercubes
• Reliability analysis of 3-ary \(n\)-cube in terms of average degree edge-connectivity
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
• The 2-extra connectivity of wheel networks
• On g-extra connectivity of corona-type graph products
• Assessing reliability of 3-ary n-cubes based on the h-extra r-component edge-connectivity
• Optimality for the restricted edge connectivity in exchanged ternary n-cubes
• On the g-extra connectivity of graphs
• The pessimistic diagnosabilities of some general regular graphs

This page was built for publication: 3-extra connectivity of 3-ary \(n\)-cube networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448858)