Abstract

We define a new class of graphs by generalizing the hypercube-like networks to folded hypercube-like networks FHn. We also investigate the reliability of this class of graphs in terms of the (edge) connectivity and super (edge) connectivity. Since this class contains two well-known hypercube variants, namely the folded hypercube and the folded crossed cube, this paper extends some previously known results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.