On linear layout of bicube and construction of optimal incomplete bicube

DOI10.1016/j.dam.2024.01.036OpenAlexW4391708035WikidataQ128174293 ScholiaQ128174293MaRDI QIDQ6130207

Paul Immanuel, A. Berin Greeni

Publication date: 2 April 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2024.01.036

zbMATH Keywords

linear layoutbicubeedge isoperimetric problemsoptimal incomplete bicube

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embeddings of circulant networks
• Linear wirelength of folded hypercubes
• Maximum number of edges joining vertices on a cube
• Exact wirelength of hypercubes on a grid
• Maximum induced subgraph of a recursive circulant
• Parallel routing algorithms for incomplete hypercube interconnection networks
• An edge-isoperimetric problem for powers of the Petersen graph
• An optimal embedding of cycles into incomplete hypercubes
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• Incomplete hypercubes: Embeddings of tree-related networks
• Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
• Embedding algorithm of spined cube into grid structure and its wirelength computation
• A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
• Fault diagnosability of bicube networks under the PMC diagnostic model
• Node set optimization problem for complete Josephus cubes
• The component connectivity, component diagnosability, and \(t/k\)-diagnosability of bicube networks
• The bicube: an interconnection of two hypercubes
• Experiments on the minimum linear arrangement problem
• Optimal Assignments of Numbers to Vertices
• Embedding complete trees into the hypercube