Super spanning connectivity on WK-recursive networks

DOI10.1016/j.tcs.2017.12.023zbMath1386.68016OpenAlexW2780334646MaRDI QIDQ1694677

Jianxi Fan, Yuejuan Han, Lantao You

Publication date: 6 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.023

zbMATH Keywords

Hamiltoniandisjoint path coverWK-recursive networksuper spanning connectivity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items

Sufficient conditions for graphs to be spanning connected, Fault tolerance of hypercube like networks: spanning laceability under edge faults, Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks, Super spanning connectivity of split-star networks, The extra connectivity and extra diagnosability of regular interconnection networks, Structure fault tolerance of WK-recursive networks

Cites Work

• Unnamed Item
• One-to-one disjoint path covers on alternating group graphs
• On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network
• Hamiltonian properties of twisted hypercube-like networks with more faulty elements
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Embedding of tori and grids into twisted cubes
• Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
• Embedding meshes/tori in faulty crossed cubes
• An efficient algorithm to construct disjoint path covers of DCell networks
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
• The two-equal-disjoint path cover problem of matching composition network
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Paths and cycles identifying vertices in twisted cubes
• Constructing optimal subnetworks for the crossed cube network