The 3-path-connectivity of the star graphs

DOI10.1016/J.DAM.2024.06.009MaRDI QIDQ6611022zbMATH OpenFDO

Authors Lin Li, Rong-Xia Hao, Wenhan Zhu

Publication date 26 September 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.06.009

zbMATH Keywords

connectivitypath-connectivitystar graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• The 3-path-connectivity of the hypercubes
• The 3-path-connectivity of the \(k\)-ary \(n\)-cube
• 3-path-connectivity of Cayley graphs generated by transposition trees
• scientific article; zbMATH DE number 1439419
• The generalized 3-connectivity of star graphs and bubble-sort graphs

Cites work

• A kind of conditional vertex connectivity of star graphs
• Conditional connectivity of Cayley graphs generated by transposition trees
• Graph theory
• Largest connected component of a star graph with faulty vertices
• Longest fault-free paths in star graphs with vertex faults
• On tree-connectivity and path-connectivity of graphs
• Path embedding in star graphs
• Path-connectivity in graphs
• Path-connectivity of lexicographic product graphs
• Pendant tree-connectivity
• The 3-path-connectivity of the \(k\)-ary \(n\)-cube
• The 3-path-connectivity of the hypercubes
• The 4-set tree connectivity of (n, k)-star networks
• The generalized 3-connectivity of star graphs and bubble-sort graphs
• The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs

Cited in

(2)

• The lower bounds of 4-tree connectivity of Cartesian product graphs
• Packing internally disjoint Steiner paths of modified bubble-sort networks

This page was built for publication: The 3-path-connectivity of the star graphs

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