Wirelength of 1-fault Hamiltonian graphs into wheels and fans

DOI10.1016/J.IPL.2011.06.011MaRDI QIDQ1944166zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.06.011

zbMATH Keywords

embeddingcongestionwirelength\(f\)-fault Hamiltonian

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Linear wirelength of folded hypercubes
• Exact wirelength of embedding circulant networks into necklace and windmill graphs.
• Computing and Combinatorics
• Ring embedding in faulty pancake graphs
• Exact wirelength of circulant networks into cycle-of-ladders.

Cites work

• scientific article; zbMATH DE number 4147467 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Arrangement graphs: A class of generalized star graphs
• Asymptotics of the average number of nondominant options of binary relations
• Augmented cubes
• Embedding of cycles and wheels into arbitrary trees
• Embedding of cycles in twisted cubes with edge-pancyclic
• Exact wirelength of hypercubes on a grid
• Hyper-Hamiltonian generalized Petersen graphs
• Locally twisted cubes are 4-pancyclic.
• On \(3^*\)-connected graphs
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• The Mobius cubes
• The congestion of \(n\)-cube layout on a rectangular grid
• The cyclic cutwidth of trees
• The shuffle-cubes and their generalization

Cited in

(14)

• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
• Node set optimization problem for complete Josephus cubes
• Embedding augmented cube into certain trees and windmill graphs
• Embedding of hypercubes into necklace, windmill and snake graphs
• Maximum incomplete recursive circulants in graph embeddings
• Embedding Wheel - like Networks
• Minimum Linear Arrangement of Generalized Sierpinski Graphs
• Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
• Wiener index via wirelength of an embedding
• Embedding of recursive circulants into certain necklace graphs
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• Wirelength of embedding complete multipartite graphs into certain graphs

This page was built for publication: Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans

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