The \(m\)-pancycle-connectivity of a WK-recursive network

DOI10.1016/j.ins.2007.04.013zbMath1135.68316MaRDI QIDQ2465332

Jywe-Fei Fang, Hui-Ling Huang, Yuh-Rau Wang

Publication date: 3 January 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.04.013

zbMATH Keywords

interconnection networks; WK-recursive networks; \(m\)-pancycle-connectivity

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

Related Items

Geodesic pancyclicity and balanced pancyclicity of the generalized base-\(b\) hypercube, Geodesic pancyclicity of twisted cubes, The bipancycle-connectivity of the hypercube, Pancyclicity of OTIS (swapped) networks based on properties of the factor graph

Cites Work

• Unnamed Item
• Embedding cycles in IEH graphs
• Hyper Hamiltonian laceability on edge fault star graph
• Edge-pancyclic block-intersection graphs
• The square of a block is vertex pancyclic
• Pancyclicity of recursive circulant graphs
• Vertex 6-pancyclic in-tournaments
• Task assignment in heterogeneous computing systems
• Hamiltonian properties on the class of hypercube-like networks
• On embedding cycles into faulty twisted cubes
• Complete path embeddings in crossed cubes
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Embedding graphs onto the Supercube