On g-extra connectivity of hypercube-like networks

作者：

Highlights：

• Correct a result in Zhu et al. (2013) [27].

• A method is given to determine the g-extra connectivity of HL-networks for small g.

• Prove that every varietal hypercube is a Cayley graph.

摘要

•Correct a result in Zhu et al. (2013) [27].•A method is given to determine the g-extra connectivity of HL-networks for small g.•Prove that every varietal hypercube is a Cayley graph.

论文关键词：HL-network,Extra connectivity,Reliability,Cayley graph

论文评审过程：Received 14 July 2016, Revised 8 December 2016, Accepted 13 April 2017, Available online 3 May 2017, Version of Record 11 June 2017.

论文官网地址：https://doi.org/10.1016/j.jcss.2017.04.002