Constructing vertex-disjoint paths in (n, k)-star graphs

DOI10.1016/J.INS.2007.09.014MaRDI QIDQ2466076zbMATH OpenOpenAlexFDO

Authors Tsung-Chi Lin, Dyi-Rong Duh

Publication date 11 January 2008

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2007.09.014

zbMATH Keywords

containergraph theoryinterconnection networksstar graphswide diametervertex-disjoint paths(\(nk\))-star graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• On the spanningw-wide diameter of the star graph
• An efficient algorithm for k-pairwise disjoint paths in star graphs
• scientific article; zbMATH DE number 1933262
• scientific article; zbMATH DE number 714464
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS

Cites work

• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square
• Analyzing permutation capability of multistage interconnection networks with colored Petri nets
• Complete path embeddings in crossed cubes
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Hamiltonian laceability of bubble-sort graphs with edge faults
• Hyper Hamiltonian laceability on edge fault star graph
• Longest fault-free paths in hypercubes with vertex faults
• Longest fault-free paths in star graphs with vertex faults
• Node-to-set disjoint paths problem in star graphs
• Node‐disjoint paths and related problems on hierarchical cubic networks
• On embedding cycles into faulty twisted cubes
• On reliability of the folded hypercubes
• On the fault-diameter of the star graph
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• The (n,k)-star graph: A generalized star graph
• Topological properties of the \((n,k)\)-star graph
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

Cited in

(28)

• Application of width distance on semi-star link satellite constellation
• On oriented diameter of \((n, k)\)-star graphs
• Fault-tolerance of (n, k)-star networks
• Maximum independent sets partition of \((n, k)\)-star graphs
• On the spanningw-wide diameter of the star graph
• The conditional fault diagnosability of (n, k)-star graphs
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• On embedding subclasses of height-balanced trees in hypercubes
• -wide diameters of enhanced pyramid networks
• Short containers in Cayley graphs
• The Number of Shortest Paths in the (n, k)-Star Graphs
• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
• The triangular pyramid: Routing and topological properties
• Weak-vertex-pancyclicity of (\(n,k\))-star graphs
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• Distance formula and shortest paths for the \((n,k)\)-star graphs
• Improving bounds on link failure tolerance of the star graph
• On the Surface Area of the (n, k)-Star Graph
• One-to-many node-disjoint paths of hyper-star networks
• A kind of conditional fault tolerance of (n, k)-star graphs
• An adaptive heuristic algorithm with the probabilistic safety vector for fault-tolerant routing on the \((n,k)\)-star graph
• Embedding meshes into twisted-cubes
• Set-to-set disjoint paths in a folded hypercube
• Diameter variability of cycles and tori
• Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
• Conditional fault-tolerant routing of \((n,k)\)-star graphs
• Properties of a hierarchical network based on the star graph
• Two-node-Hamiltonicity of enhanced pyramid networks

This page was built for publication: Constructing vertex-disjoint paths in \((n, k)\)-star graphs

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