On the spanningw-wide diameter of the star graph

DOI10.1002/NET.20135MaRDI QIDQ3418210zbMATH OpenOpenAlexFDO

Authors Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu

Publication date 2 February 2007

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20135

zbMATH Keywords

containerdisjoint pathswidth

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Wide diameter and diameter of networks.
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• Wide-diameter and minimum length of fan
• Containers and wide diameters of \(P_3(G)\).

Cited in

(11)

• On the spanning fan-connectivity of graphs
• Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
• On the spanning connectivity of tournaments
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Fault-free mutually independent Hamiltonian cycles of faulty star graphs
• Wide diameter and diameter of networks.
• Containers and wide diameters of \(P_3(G)\).
• Application of width distance on semi-star link satellite constellation
• Property \(P_{d,m}\) and efficient design of reliable networks
• On spanning wide diameter of spider web networks

This page was built for publication: On the spanningw-wide diameter of the star graph

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