Path embedding in star graphs
From MaRDI portal
Publication:1002273
DOI10.1016/J.AMC.2008.10.040zbMATH Open1163.05011OpenAlexW2057855686MaRDI QIDQ1002273FDOQ1002273
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
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
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Cycle embedding in star graphs with edge faults
- Paths in Möbius cubes and crossed cubes
- Optimal fault-tolerant embedding of paths in twisted cubes
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- On the fault-diameter of the star graph
- Embedding binary trees into crossed cubes
- Hamiltonian-laceability of star graphs
- Edge-bipancyclicity of star graphs under edge-fault tolerant
- Pancyclicity of recursive circulant graphs
- Longest fault-free paths in star graphs with vertex faults
- Mutually independent hamiltonian paths in star networks
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
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- Cycle embedding in star graphs with more conditional faulty edges
- 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)
