On the strong distance problems of pyramid networks

DOI10.1016/J.AMC.2007.04.076MaRDI QIDQ2467410zbMATH OpenOpenAlexFDO

Authors Justie Su-tzu Juan, Chun-Ming Huang

Publication date 21 January 2008

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2007.04.076

zbMATH Keywords

interconnection networkpyramid networkstrong diameterstrong distancestrong radius

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1416462
• scientific article; zbMATH DE number 6837061
• On strong distances in oriented graphs
• The strong distance problem on the Cartesian product of graphs
• scientific article; zbMATH DE number 6107225

Cites work

• -wide diameters of enhanced pyramid networks
• A textbook of graph theory
• Distance in digraphs
• Fault tolerance properties of pyramid networks
• 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?)
• 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

Cited in

(6)

• On the strong distance problems of pyramid networks
• scientific article; zbMATH DE number 5846238 (Why is no real title available?)
• scientific article; zbMATH DE number 5115622 (Why is no real title available?)
• The optimal strong radius and optimal strong diameter of the Cartesian product graphs
• Distance-edge-monitoring sets of networks
• The strong distance problem on the Cartesian product of graphs

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)