Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans

DOI10.1016/j.ipl.2011.06.011zbMath1260.68291OpenAlexW2025582593MaRDI QIDQ1944166

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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Embedding of cycles in twisted cubes with edge-pancyclic
• Exact wirelength of hypercubes on a grid
• Asymptotics of the average number of nondominant options of binary relations
• Arrangement graphs: A class of generalized star graphs
• The cyclic cutwidth of trees
• The shuffle-cubes and their generalization
• Locally twisted cubes are 4-pancyclic.
• The congestion of \(n\)-cube layout on a rectangular grid
• Hyper-Hamiltonian generalized Petersen graphs
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• The Mobius cubes
• Embedding of cycles and wheels into arbitrary trees
• Augmented cubes

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