On the strong distance problems of pyramid networks

DOI10.1016/J.AMC.2007.04.076zbMATH Open1135.68519OpenAlexW1986778196MaRDI QIDQ2467410FDOQ2467410

Chun-Ming Huang, Justie Su-tzu Juan

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 networkstrong diameterstrong distancestrong radiuspyramid network

Mathematics Subject Classification ID

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

Cites Work

• A textbook of graph theory
• On strong distances in oriented graphs
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Fault tolerance properties of pyramid networks
• \(\omega \)-wide diameters of enhanced pyramid networks
• On the strong distance problems of pyramid networks
• The strong distance problem on the Cartesian product of graphs
• Distance in digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• On the strong distance problems of pyramid networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• The optimal strong radius and optimal strong diameter of the Cartesian product graphs
• The strong distance problem on the Cartesian product of graphs
• Distance-edge-monitoring sets of networks

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)