{2,3}-Extraconnectivities of hypercube-like networks

► A novel network metric, called g-extraconnectivity, for hypercube-like networks (HL-graphs) is investigated. ► Improving the previously best known result for the 2-extraconnectivity of an HL-graph. ► The solving mechanism involves finding both an upper bound and a lower bound with the same value. ► A table is used to summarize our results on several applications of HL-graphs.