A note about some properties of BC graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3735859 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- Hamiltonian properties on the class of hypercube-like networks
- Maximum number of edges joining vertices on a cube
- Routing properties of supercubes
- The Mobius cubes
- The locally twisted cubes
Cited in
(9)- On the \(t/k\)-diagnosability of BC networks
- Sets of binary sequences with small total Hamming distances
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- Adaptive diagnosis of Hamiltonian networks under the comparison model
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- A note on minimum linear arrangement for BC graphs
- Edge-fault tolerance of hypercube-like networks
- Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction
- The congestion of generalized cube communication pattern in linear array network
This page was built for publication: A note about some properties of BC graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975502)