On the strong distance problems of pyramid networks
From MaRDI portal
Publication:2467410
Recommendations
Cites work
- scientific article; zbMATH DE number 3991541 (Why is no real title available?)
- scientific article; zbMATH DE number 4033059 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 1416462 (Why is no real title available?)
- scientific article; zbMATH DE number 1439402 (Why is no real title available?)
- scientific article; zbMATH DE number 2200042 (Why is no real title available?)
- A textbook of graph theory
- Distance in digraphs
- Fault tolerance properties of pyramid networks
- On strong distances in oriented graphs
- On the strong distance problems of pyramid networks
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability
- The strong distance problem on the Cartesian product of graphs
- \(\omega \)-wide diameters of enhanced pyramid networks
Cited in
(6)- The optimal strong radius and optimal strong diameter of the Cartesian product graphs
- scientific article; zbMATH DE number 5846238 (Why is no real title available?)
- On the strong distance problems of pyramid networks
- The strong distance problem on the Cartesian product of graphs
- Distance-edge-monitoring sets of networks
- scientific article; zbMATH DE number 5115622 (Why is no real title available?)
This page was built for publication: On the strong distance problems of pyramid networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467410)