Path embedding in star graphs

DOI10.1016/J.AMC.2008.10.040MaRDI QIDQ1002273zbMATH OpenOpenAlexFDO

Authors 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

embeddingHamiltonianinterconnection networkpathstar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Recommendations

• Representing triangulated graphs in stars
• Embedded connectivity of \( (n, k)\)-star graphs
• Embedding meshes on the star graph
• Embedding an arbitrary binary tree into the star graph
• scientific article; zbMATH DE number 1151850
• Star decomposition of graphs
• Embedding complete binary trees into star networks
• Cycle embedding in star graphs with edge faults
• Embedding longest fault-free paths onto star graphs with more vertex faults

Cites work

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

Cited in

(21)

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

This page was built for publication: Path embedding in star graphs

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