Combinatorial properties of generalized hypercube graphs

DOI10.1016/0020-0190(95)00173-5zbMath0900.68329OpenAlexW2135557093MaRDI QIDQ1350759

D. Frank Hsu, Dyi-Rong Duh, Gen-Huey Chen

Publication date: 27 February 1997

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

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154708/1/30.pdf

zbMATH Keywords

AlgorithmsGraph theory

Mathematics Subject Classification ID

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

Related Items (11)

Two spanning disjoint paths with required length in generalized hypercubes ⋮ Reliability evaluation for a class of recursive match networks ⋮ The \(h\)-restricted connectivity of the generalized hypercubes ⋮ A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices ⋮ The generalized 3-connectivity of two kinds of regular networks ⋮ Lazy Cops and Robbers on generalized hypercubes ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ Topological properties of twisted cube ⋮ Short containers in Cayley graphs ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ Reliability analysis of the generalized balanced hypercube

Cites Work

• Fault diameter of interconnection networks
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Unnamed Item

This page was built for publication: Combinatorial properties of generalized hypercube graphs