Path embedding in star graphs

DOI10.1016/j.amc.2008.10.040zbMath1163.05011MaRDI QIDQ1002273

Ming-Chien Yang

Publication date: 25 February 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2008.10.040

zbMATH Keywords

embedding; Hamiltonian; path; interconnection network; star graph

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

Embedding complete multi-partite graphs into Cartesian product of paths and cycles, Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees, Hamiltonian cycle embedding for fault tolerance in balanced hypercubes, Two node-disjoint paths in balanced hypercubes, Embeddings of circulant networks, Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, Cycle embedding in star graphs with more conditional faulty edges, Embedding of hypercubes into necklace, windmill and snake graphs, Bipanconnectivity of balanced hypercubes, Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes, Cycle embedding in star graphs with conditional edge faults, Embedding cycles of various lengths into star graphs with both edge and vertex faults, The panpositionable panconnectedness of augmented cubes, Wirelength of embedding complete multipartite graphs into certain graphs, Embedding of recursive circulants into certain necklace graphs, The spanning cyclability of Cayley graphs generated by transposition trees, Maximum incomplete recursive circulants in graph embeddings

Cites Work

• Edge-bipancyclicity of star graphs under edge-fault tolerant
• Optimal fault-tolerant embedding of paths in twisted cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Paths in Möbius cubes and crossed cubes
• On the fault-diameter of the star graph
• Pancyclicity of recursive circulant graphs
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Cycle embedding in star graphs with edge faults
• A group-theoretic model for symmetric interconnection networks
• Embedding binary trees into crossed cubes
• Hamiltonian-laceability of star graphs
• Mutually independent hamiltonian paths in star networks
• Longest fault-free paths in star graphs with vertex faults