The embedding of rings and meshes into RP (k) networks

MaRDI QIDQ866115zbMATH OpenFDO

Authors N. E. Zubov

Publication date 20 February 2007

Published in Science in China. Series F (Search for Journal in Brave)

zbMATH Keywords

network embeddingHamiltonian cycledilationcongestioninterconnection networkPetersen graph\(\text{RP} (k)\)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Eulerian and Hamiltonian graphs (05C45) Network design and communication in computer systems (68M10)

Recommendations

• Embedding Meshes and Tori on Double-Loop Networks of the Same Size
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Embedding hypergraph in trees of rings
• On the interconnected networks based on ringed crossed-cube Petersen
• On networks over finite rings
• Optimal embedding of multiple directed Hamiltonian rings into \(d\)-dimensional meshes
• On the net-embeddability of graphs
• Polyhedral results for two-connected networks with bounded rings
• Embeddings of circulant networks

Cited in

(2)

• Embedding of elementary net into gap of nets
• Optimal embedding of multiple directed Hamiltonian rings into \(d\)-dimensional meshes

This page was built for publication: The embedding of rings and meshes into \(\text{RP} (k)\) networks

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