Combinatorial properties of generalized hypercube graphs
From MaRDI portal
Publication:1350759
DOI10.1016/0020-0190(95)00173-5zbMath0900.68329MaRDI 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
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
Related Items
A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices, Reliability evaluation for a class of recursive match networks, Two spanning disjoint paths with required length in generalized hypercubes, Lazy Cops and Robbers on generalized hypercubes, Two conditions for reducing the maximal length of node-disjoint paths in hypercubes, Short containers in Cayley graphs, Topological properties of twisted cube, Reliability analysis of the generalized balanced hypercube, The \(h\)-restricted connectivity of the generalized hypercubes, The generalized 3-connectivity of two kinds of regular networks, On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
Cites Work
