Exact wirelength of circulant networks into cycle-of-ladders.

MaRDI QIDQ4598974zbMATH OpenFDO

Authors Micheal Arockiaraj, L. Packiaraj, R. Sundara Rajan

Publication date 15 December 2017

zbMATH Keywords

embeddingcongestionwirelengthcirculant networkscycle-of-ladders

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Exact wirelength of embedding circulant networks into necklace and windmill graphs.
• Embeddings of circulant networks
• Bothway embedding of circulant network into grid
• Wirelength of embedding complete multipartite graphs into certain graphs
• Embedding circulant and grid based network

Cited in

(10)

• Exact wirelength of embedding circulant networks into necklace and windmill graphs.
• Embedding of recursive circulant \(RC(2^{n},4)\) into circular necklace
• Embedding Wheel - like Networks
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• An asymptotic relation between the wirelength of an embedding and the Wiener index
• Bothway embedding of circulant network into grid
• Embeddings of circulant networks
• Embedding circulant and grid based network
• Embedding of recursive circulants into certain necklace graphs
• Wirelength of embedding complete multipartite graphs into certain graphs

This page was built for publication: Exact wirelength of circulant networks into cycle-of-ladders.

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