2-Edge Hamiltonian Connectedness: Characterization and Results in Data Center Networks
Mei-Li Wang, Rong-Xia Hao, Jou-Ming Chang, and Sejeong Bang
Applied Mathematics and Computation, Vol. 490 (2025) Article 129197.

The above article has been cited by the articles listed below.
  1. Huimei Guo, Rong-Xia Hao, Jie Wu, 2-Edge-Hamilton-Connected Dragonfly Network, Journal of Parallel and Distributed Computing 202 (2025) 105095. (*)

  2. Huimei Guo, Rong-Xia Hao, Jou-Ming Chang, 2-edge-Hamilton-connectedness of complete hypercube-like networks, Discrete Applied Mathematics 381 (2025) 23-31. (*)

  3. Jung-Heum Park, On paired 2-disjoint path coverability of Johnson and generalized Johnson graphs, IEEE Access 14 (2026) 42366-42380. (*)

  4. Huimei Guo, Rong-Xia Hao, Mei-Li Wang, Jou-Ming Chang, Young Soo Kwon, Characterizing k-edge Hamiltonian connectedness for enhancing network structures, Information and Computation 311 (2026) 105461. (*)

Times cited: 4 (from Web of Science)