Combinatorial properties of generalized hypercube graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- Two spanning disjoint paths with required length in generalized hypercubes
- Topological properties of twisted cube
- Combinatorial multinomial generators for colorings of 4D-hypercubes and their applications
- The \(h\)-restricted connectivity of the generalized hypercubes
- Short containers in Cayley graphs
- Reliability analysis of the generalized balanced hypercube
- Combinatorial properties of full-flag Johnson graphs
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
- On container length and wide-diameter in undirectional hypercubes
- The generalized 3-connectivity of two kinds of regular networks
- Combinatorial properties of the G-degree
- Lazy Cops and Robbers on generalized hypercubes
- Reliability evaluation for a class of recursive match networks
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
- On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
This page was built for publication: Combinatorial properties of generalized hypercube graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350759)