Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks

DOI10.1016/j.tcs.2022.01.020OpenAlexW2546543913WikidataQ114129134 ScholiaQ114129134MaRDI QIDQ2077379

Eddie Cheng, Mohamad Abdallah

Publication date: 21 February 2022

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

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

zbMATH Keywords

fault toleranceHamiltonian connectivity\(2\)-tree generated networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• Edge-bipancyclicity of star graphs with faulty elements
• Hyper Hamiltonian laceability on edge fault star graph
• Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
• Hamiltonian connectivity of 2-tree-generated networks
• Arrangement graphs: A class of generalized star graphs
• The \((n,k)\)-star graph: A generalized star graph
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Fault-tolerant Hamiltonian laceability of hypercubes.
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• On mutually independent Hamiltonian paths
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• The Indirect Binary n-Cube Microprocessor Array
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Augmented cubes
• A new class of interconnection networks based on the alternating group
• The number of labeled k-dimensional trees
• Properties and characterizations of k ‐trees

This page was built for publication: Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks