Optimal generalized Petersen graphs

MaRDI QIDQ3115186zbMATH OpenFDO

Authors E. A. Monakhova

Publication date 20 February 2012

zbMATH Keywords

circulant graph of degree fourdiametergeneralized Petersen graphoptimal graphshortest path

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4068910
• Wide diameter of generalized Petersen graphs
• scientific article; zbMATH DE number 2114049
• Minimal diameter double-loop networks. I. Large infinite optimal families
• scientific article; zbMATH DE number 1432345

Cited in

(10)

• Topological properties of the recursive Petersen architecture
• Wide diameter of generalized Petersen graphs
• scientific article; zbMATH DE number 4068910 (Why is no real title available?)
• scientific article; zbMATH DE number 2114049 (Why is no real title available?)
• scientific article; zbMATH DE number 1420913 (Why is no real title available?)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• Topology and routing algorithms of double-loops connected Petersen graph networks
• On the diameter of generalized Petersen graphs
• A practical interconnection network \(\text{RP}(k)\) and its routing algorithms
• On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings

This page was built for publication: Optimal generalized Petersen graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115186)