Disjoint path covers of star graphs

DOI10.1016/J.AMC.2024.129098MaRDI QIDQ6993924zbMATH OpenFDO

Authors Hongwei Qiao, Jixiang Meng

Publication date 24 April 2025

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

Full work available at URL https://doi.org/10.1016/J.AMC.2024.129098

zbMATH Keywords

disjoint path coverHamiltonian pathstar graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A group-theoretic model for symmetric interconnection networks
• An efficient algorithm to construct disjoint path covers of DCell networks
• Conditional connectivity
• Conditional connectivity of Cayley graphs generated by transposition trees
• Degree sequence conditions for a graph to be disjoint path coverable
• Disjoint path covers in cubes of connected graphs
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
• Graph theory
• Hamiltonian-laceability of star graphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Hyper Hamiltonian laceability on edge fault star graph
• Linearly many faults in Cayley graphs generated by transposition trees
• Link fault tolerance of BC networks and folded hypercubes on h-extra r-component edge-connectivity
• Longest paths and cycles in faulty star graphs
• Many-to-many disjoint path covers in k-ary n-cubes
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Optimal fault-tolerant embedding of paths in twisted cubes
• Ore-type degree conditions for disjoint path covers in simple graphs
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Paired many-to-many disjoint path covers of the hypercubes
• Path embedding in star graphs
• Torus-like graphs and their paired many-to-many disjoint path covers
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements

Cited in

(2)

• 2-edge-Hamilton-connectedness of complete hypercube-like networks
• Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs

This page was built for publication: Disjoint path covers of star graphs

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