Skip to main content

Structural Properties of Generalized Exchanged Hypercubes

  • Chapter
  • First Online:
Emergent Computation

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 24))

Abstract

It has been shown that, when a linear number of vertices are removed from a Generalized Exchanged Hypercube (GEH), a generalized version of the interesting exchanged hypercube, its surviving graph consists of a large connected component and smaller component(s) containing altogether a rather limited number of vertices. In this chapter, we further apply the above connectivity result to derive several fault-tolerance related structural parameters for GEH, including its restricted connectivity, cyclic vertex-connectivity, component connectivity, and its conditional diagnosability in terms of the comparison diagnosis model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Angjeli, A., Cheng, E., Lipták, L.: Linearly many faults in dual-cube-like networks. Theor. Comput. Sci. 472, 1–8 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chartrand, G., Kapoor, S.F., Lesniak, L., Lick, D.R.: Generalized connectivity in graphs. Bull. Bombay Math. Colloq. 2, 1–6 (1984)

    Google Scholar 

  3. Chen, Y.-W.: A comment on “The exchanged hypercube”. IEEE Trans. Parallel Dist. Syst. 18, 576 (2007)

    Google Scholar 

  4. Cheng, E., Lipták, L.L., Qiu, K., Shen, Z.: On deriving conditional diagnosability of interconnection networks. Inf. Process. Lett. 112, 674–677 (2012)

    Google Scholar 

  5. Cheng, E., Lipták, L.L., Qiu, K., Shen, Z.: A unified approach to the conditional diagnosability of interconnection networks. J. Interconnect. Netw. 13, 1250007 (19 pages) (2012)

    Google Scholar 

  6. Cheng, E., Lipták, L.L., Qiu, K., Shen, Z.: Cyclic vertex connectivity of Cayley graphs generated by transposition trees. Graphs Comb. 29(4), 835–841 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cheng, E., Qiu, K., Shen, Z.: On the conditional diagnosability of matching composition networks. Theor. Comput. Sci. 557, 101–114 (2014)

    Google Scholar 

  8. Cheng, E., Qiu, K., Shen, Z.: Connectivity results of complete cubic network as associated with linearly many faults. J. Interconnect. Netw. 15(1 & 2), 1550007 (23 pages) (2015)

    Google Scholar 

  9. Cheng, E., Qiu, K., Shen, Z.: A strong connectivity property of the generalized exchanged hypercube. Discrete Appl. Math. http://dx.doi.org/10.1016/j.dam.2015.11.014

  10. Esfahanian, A.H.: Generalized measures of fault tolerance with application to \(n\)-cube networks. IEEE Trans. Comput. 38(11), 1586–1591 (1989)

    Google Scholar 

  11. Esfahanian, A.H., Hakimi, S.L.: On computing a conditional edge-connectivity of a graph. Inf. Process. Lett. 27, 195–199 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hager, M.: Pendant tree-connectivity. J. Comb. Theory 38, 179–189 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  13. Harary, F., Hayes, J.P., Wu, H.-J.: A survey of the theory of hypercube. Comput. Math. Appl. 15(4), 277–289 (1988)

    Google Scholar 

  14. Hong, W.-S., Hsieh, S.-Y.: Strong diagnosability and conditional diagnosability of augmented cubes under the comparison diagnosis model. IEEE Trans. Reliab. 61, 140–148 (2012)

    Google Scholar 

  15. Hsu, L.-H., Cheng, E., Lipták, L., Tan, J.J.M., Lin, C.-K., Ho, T.-Y.: Component connectivity of the hypercubes. Int. J. Comput. Math. 89(2), 137–145 (2012)

    Google Scholar 

  16. Klavžar, S., Ma, M.: The domination number of exchanged hypercubes. Inf. Process. Lett. 114, 159–162 (2014)

    Google Scholar 

  17. Klavžar, S., Ma, M.: Average distance, surface area, and other structural properties of exchanged hypercubes. J. Supercomput. 69, 306–317 (2014)

    Google Scholar 

  18. Lai, P.-L., Tan, J.J.M., Chang, C.-P., Hsu, L.-H.: Conditional diagnosability measures for large multiprocessor systems. IEEE Trans. Comput. 54, 165–175 (2005)

    Google Scholar 

  19. Li, X., Mao, Y.: The generalized 3-connectivity of lexicographic product graphs. Discrete Math. Theor. Comput. Sci. 16(1), 339–354 (2014)

    MathSciNet  MATH  Google Scholar 

  20. Li, X.-J., Xu, J.-M.: Generalized measures of fault tolerance in exchanged hypercubes. Inf. Process. Lett. 113, 533–537 (2013)

    Google Scholar 

  21. Li, Y., Peng, S., Chu, W.: Efficient collective communications in dual-cube. J. Supercomput. 28, 71–90 (2004)

    Article  MATH  Google Scholar 

  22. Loh, P.K.K., Hsu, W.J., Pan, Y.: The exchanged hypercube. IEEE Trans. Parallel Dist. Syst. 16, 866–874 (2005)

    Google Scholar 

  23. Ma, M., Liu, B.: Cycles embedding in exchanged hypercubes. Inf. Process. Lett. 110, 71–76 (2009)

    Google Scholar 

  24. Ma, M.: The connectivity of exchanged hypercubes. Discrete Math. Algorithms Appl. 2, 213–220 (2010)

    Google Scholar 

  25. Ma, M., Zhu, L.: The super connectivity of exchanged hypercubes. Inf. Process. Lett. 111, 360–364 (2011)

    Google Scholar 

  26. Maeng, J., Malek, M.: A comparison connection assignment for self-diagnosis of multiprocessor systems. In: Proceedings of 11th International Symposium on Fault-Tolerant Computing, pp. 173–175 (1981)

    Google Scholar 

  27. Malek, M.: A comparison connection assignment for diagnosis of multiprocessor systems. In: Proceedings of 7th International Symposium on Computer Architecture, pp. 31–35 (1980)

    Google Scholar 

  28. Oellermann, O.R.: On the l-connectivity of a graph. Graphs Comb. 3, 285–299 (1987)

    Article  MATH  Google Scholar 

  29. Oellermann, O.R.: A note on the l-connectivity function of a graph. Congessus Numerantium 60, 181–188 (1987)

    MathSciNet  Google Scholar 

  30. Oh, A.D., Choi, H.-A.: Generalized measures of fault tolerance in \(n\)-cube networks. IEEE Trans. Parallel Dist. Syst. 4, 702–703 (1993)

    Google Scholar 

  31. Peng, S.L., Lin, C.K., Tan, J.J.M., Hsu, L.H.: The \(g\)-good-neighbor conditional diagnosability of hypercube under the PMC model. Appl. Math. Comput. 218(21), 10406–10412 (2012)

    Google Scholar 

  32. Sampathkumar, E.: Connectivity of a graph— A generalization. J. Comb. Inform. Syst. Sci. 9, 71–78 (1984)

    Google Scholar 

  33. Sengupta, A., Dahbura, A.T.: On self-diagnosable multiprocessor systems: diagnosis by the comparison approach. IEEE Trans. Comput. 41, 1386–1396 (1992)

    Article  MathSciNet  Google Scholar 

  34. Stewart, I.: A general technique to establish the asymptotic conditional diagnosability of interconnection networks. Theor. Comput. Sci. 452, 132–147 (2012)

    Google Scholar 

  35. Sullivan, G.F.: A polynomial time algorithm for fault diagnosability. In: Proceedings of 25th Annual Symposium Foundations Computer Science, IEEE Computer Society, pp. 148–156 (1984)

    Google Scholar 

  36. Tai, P.G.: Remarks on the coloring of maps. Proc. R. Soc. Edinb. 10, 501–503 (1880)

    Article  Google Scholar 

  37. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River, NJ (2001)

    Google Scholar 

  38. Wu, J., Guo, G.: Fault tolerance measures for \(m\)-ary \(n\)-dimensional hypercubes based on forbidden faulty sets. IEEE Trans. Comput. 47, 888–893 (1998)

    Google Scholar 

  39. Xu, J.-M., Wang, J.-W., Wang, W.-W.: On super and restricted connectivity of some interconnection networks. Ars Combinatoria 94, 25–32 (2010)

    Google Scholar 

  40. Yang, M.-C.: Conditional diagnosability of balanced hypercubes under the \(MM^*\) model. J. Supercomput. 65, 1264–1278 (2013)

    Google Scholar 

  41. Yang, X., Evans, D.J., Megson, G.M.: On the maximal connected component of a hypercube with faulty vertices. Int. J. Comput. Math. 81(5), 515–525 (2004)

    Google Scholar 

  42. Yang, X., Evans, D.J., Megson, G.M.: On the maximal connected component of a hypercube with faulty vertices II. Int. J. Comput. Math. 81(10), 1175–1185 (2004)

    Google Scholar 

  43. Yang, X., Evans, D.J., Megson, G.M.: On the maximal connected component of a hypercube with faulty vertices III. Int. J. Comput. Math. 83(1), 27–37 (2006)

    Google Scholar 

  44. Yu, Z., Liu, Q., Zhang, Z.: Cyclic vertex connectivity of star graphs. In: Proceedings of Fourth Annual International Conference on Combinatorial Optimization and Applications (COCOA’2010) Dec. 18–20, 2010, Kailua-Kona, HI, USA, Springer LNCS 6508(Part I), pp. 212–221 (2010)

    Google Scholar 

  45. Yuan, J., Liu, A., Ma, X., Liu, X., Qin, X., Zhang, J.: The \(g\)-good-neighbor conditional diagnosability of \(k\)-ary \(n\)-cubes under the PMC model and MM* model. Int. J. Parallel, Emergent Distrib. Syst. 26(4), 1165–1177 (2015)

    Google Scholar 

  46. Zhang, C.Q.: Integer Flows and Cycle Covers of Graphs. Marcel Dekker Inc., New York (1997)

    Google Scholar 

  47. Zhu, Q.: On conditional diagnosability and reliability of the BC networks. J. Supercomput. 45, 173–1184 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eddie Cheng .

Editor information

Editors and Affiliations

Appendix

Appendix

In this section, we give a proof of \(s=3\) for Part 2 of Theorem 1. We first state a number of preliminary results from [9]. (The proof of Lemma 5 was omitted but it is similar to the one for Lemma 4.)

Lemma 4

[9, Lemma  3.3] \(GEH(s, t), 1 \le s \le t,\) is \(\delta \)-maximally connected.

Lemma 5

[9, Lemma  3.4] \(GEH(s, t), 2 \le s \le t,\) is \(\delta \)-tightly super-connected.

Lemma 6

[9, Lemma  4.1] Let \(F \subset V(GEH(s, t)), s \in [2, t],\) \(|F|\le ks-\frac{k(k-1)}{2},\) there exists Y,  a connected component of GEH(st) \(-F,\) such that, for all \(i \in [0, 2^s+2^t),\) if \(C_i-F_i\) is connected, it is a subgraph of Y.

We note that Lemma 5 does not hold for \(s=1\) as GEH(1, t) contains \(2^t\) Class-0 clusters, each of which is an edge, and two Class-1 clusters, each isomorphic to a \(Q_t.\) (Cf. Fig. 2b). Let (uv) be one of these edges. When \(\{u', v'\} \subseteq F,\) \(GEH(1, t)-F\) contains (uv) and other components containing a total of \(2^{t+2}-2 \ge 6\) vertices.

We are now ready to prove \(s=3\) for Part 2 of Theorem 1. When \(s=3,\) \(k \in [1, 3].\) We notice that, when \(k=1,\) \(|F|\le s,\) \(GEH(s, t)-F\) is then connected, by Lemma 4. We thus only need to consider the cases of \(k=2\) and \(k=3.\)

For the case of \(k=2,\) thus \(|F|\le 5\) by Part 2, we need to show that \(GEH(3, t)-F, t \ge 3,\) is either connected or contains a large component together with a singleton. By Lemma 5, when \(|F| \le 4,\) \(GEH(3, t)-F\) is either connected or it consists of a large component and one singleton. Thus, we only need to consider the case of \(|F|=5.\)

Let \(F_i=F \cap V(C_i), i \in [0, 2^s+2^t).\) If, for some \(l, |F_l|=5,\) then all the other clusters contain no faulty vertices, thus they are all connected. Clearly \(GEH(s, t)-F_l\) will be connected, as well, since every vertex in \(C_l-F_l\) is adjacent, via a cross edge, to a vertex located in a connected cluster. If for some l\(|F_l|=4,\) and the remaining faulty vertex f falls into another cluster, then all the clusters, other than \(C_l,\) are connected. \(GEH(s, t)-F\) is then either connected or contains a large component and a singleton \(u\ (\in V(C_l) \setminus F_l)\), when \(C_l\) is isomorphic to \(Q_3,\) u is adjacent to f via a cross edge, and all the three neighbors of u in \(C_l\) fall into \(F_l.\) We now assume that \(|F_l|=3,\) when the other clusters collectively hold two faulty vertices, thus all connected by the maximum connectivity of hypercubes, as \(s =3.\) If \(C_l-F_l\) is connected, so is \(GEH(s, t)-F\) by Lemma 6. Otherwise, if \(C_l-F_l\) is disconnected, then \(C_l\) is isomorphic to \(Q_3,\) and \(C_l-F_l\) contains a \(K_{1, 3}\) and a singleton f. Since the other clusters jointly hold two faulty vertices, this \(K_{1, 3}\) must be part of the large component of \(GEH(3, t)-F,\) as at least one of its four vertices is adjacent to a non-faulty vertex in this large component. Then, \(GEH(3, t), 3 \le t,\) is either connected or contains a large component and one singleton u when u is adjacent to one of the two faulty vertices, while all its three neighbors in \(C_l\) form \(F_l.\) The other cases are symmetric to the above.

We now turn to the case of \(k=3,\) i.e., \(|F| \le 6,\) when we have to show that \(GEH(3, t)-F, t \ge 3,\) is either connected or contains a large component and small components altogether with at most two vertices. In light of the previous case, we only need to consider the case of \(|F|=6.\)

If for some \(l, |F_l| \ge 4,\) then other clusters, sharing at most two faulty vertices, must be individually connected in the resulting graph by the assumption of \(s=3\) and Lemma 4, and belong to the same component, say Y, in the resulting graph by Lemma 6. By definition, those non-faculty vertices of \(C_l\) are part of Y. Hence, \(GEH(s, t)-F\) is either connected, or contains a large component and smaller ones with at most two vertices, when the remaining up to two vertices in \(V(C_l) \setminus C_l\) are adjacent to the faulty vertices in \(F \setminus F_l\) via cross edges, while sharing their faulty neighbors in \(F_l.\)

We now consider the case when, for all l\(F_l\) contains at most three of these vertices. Since for all l\(C_l\) is isomorphic to a cube \(Q_m, m \ge s\ (=3),\) when \(m \ge 4,\) all such \(C_l-F_l\)’s are connected by Lemma 4, and so is \(GEH(s, t)-F,\) by Lemma 6. We thus only need to consider the case when \(C_l\) is isomorphic to \(Q_3,\) where \(|F_l|=3.\)

If for some l\(|F_l|=3,\) and for \(j \not = l, |F_j|<3,\) then \(C_j-F_j\), \(j\not = l,\) will all be connected by Lemma 6. If \(C_l-F_l\) is connected, so is \(GEH(s, t)-F\) by Lemma 6. Now assume that \(C_l-F_l\) is not connected. Notice that \(C_l\) is isomorphic to a \(Q_3,\) and its surviving graph contains a singleton u and a \(K_{1, 3}.\) Since there are only three faulty vertices located outside \(C_l,\) and \(K_{1, 3}\) contains four vertices, it must be part of a large connected component. Thus, in this case, \(GEH(3, t), t \ge 3,\) is either connected or contains a large component and a singleton u,  when u is adjacent to one of these remaining faulty vertices in \(F \setminus F_l,\) and all its three neighbors are contained in \(F_l.\)

We finally consider the subcase that \(|F_l|=|F_{l'}|=3,\) where both \(C_l\) and \(C_{l'}\) are isomorphic to \(Q_3,\) when, for \(j \not \in \{l, l'\},\) \(F_j\) is empty. If both \(C_l-F_l\) and \(C_{l'}-F_{l'}\) are connected, then GEH(st) is also connected by Lemma 6. We now assume, without loss of generality, \(C_l-F_l\) is connected, but \(C_{l'}-F_{l'}\) is not, when it contains a singleton \(u'\) and a \(K_{1, 3}.\) \(GEH(s, t)-F,\) in this case, is either connected or contains a large component and a singleton \(u'\) when it is adjacent to a vertex in \(F_l\) and all its three neighbors in \(C_l'\) constitute \(F_l'.\) For the remaining case, when neither of them is connected, namely, \(C_l-F_l\) (respectively, \(C_{l'}-F_{l'}\)) contains a singleton u (respectively, \(u'\)) and a \(K_{1, 3}.\) By the same token, \(GEH(s, t)-F\) is either connected or it contains a large component and smaller component(s) with at most two faulty vertices u and \(u',\) when \(u'\) (respectively, u) is adjacent to a vertex in \(F_l\) (respectively, \(F_{l'}\)) and all its three neighbors in \(C_l'\) (respectively, \(C_l\)) fall into \(F_l'\) (respectively, \(F_l\)).

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Cheng, E., Qiu, K., Shen, Z. (2017). Structural Properties of Generalized Exchanged Hypercubes . In: Adamatzky, A. (eds) Emergent Computation . Emergence, Complexity and Computation, vol 24. Springer, Cham. https://doi.org/10.1007/978-3-319-46376-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46376-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46375-9

  • Online ISBN: 978-3-319-46376-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics