The 3-path-connectivity of the \(k\)-ary \(n\)-cube
From MaRDI portal
Publication:2673958
DOI10.1016/j.amc.2022.127499OpenAlexW4293796032WikidataQ113880691 ScholiaQ113880691MaRDI QIDQ2673958
Wenhan Zhu, Jaeun Lee, Yan Quan Feng, Rong-xia Hao
Publication date: 21 September 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.127499
Computer system organization (68Mxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (4)
3-path-connectivity of Cayley graphs generated by transposition trees ⋮ Fault tolerance of recursive match networks based on \(g\)-good-neighbor fault pattern ⋮ Path connectivity of line graphs and total graphs of complete bipartite graphs ⋮ The 3-path-connectivity of the hypercubes
Cites Work
- Unnamed Item
- Extraconnectivity of \(k\)-ary \(n\)-cube networks
- Pendant tree-connectivity
- Path-connectivity in graphs
- The generalized 3-connectivity of graph products
- The generalized connectivity of the line graph and the total graph for the complete bipartite graph
- The generalized 3-connectivity of the Mycielskian of a graph
- On tree-connectivity and path-connectivity of graphs
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- Path-connectivity of lexicographic product graphs
- Lee distance and topological properties of k-ary n-cubes
This page was built for publication: The 3-path-connectivity of the \(k\)-ary \(n\)-cube