Skip to main content
SpringerLink
Log in

Star structure connectivity of cayley graphs generated by transposition trees

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

To provide more accurate indicator for the fault-tolerance of networks, structure connectivity and substructure connectivity have been introduced. H-structure connectivity \(\kappa (G;H)\) is the minimum number of subgraphs isomorphic to H in G, such that the deletion of those subgraphs disconnects G. H-substructure connectivity \(\kappa ^s(G;H)\) is the minimum number of subgraphs isomorphic to connected subgraphs of H in G, such that the deletion of those subgraphs disconnects G. In this paper, we establish star structure and star substructure connectivity of Cayley graphs generated by transposition trees, which include bubble-sort graph and star graph.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Data Availability

No data and material.

References

  1. Harary F (1983) Conditional connectivity. Networks 13(3):347–357. https://doi.org/10.1002/net.3230130303

    Article  MATH  Google Scholar 

  2. Day K (2004) The conditional node connectivity of the \(k\)-ary \(n\)-cube. J Interconnect Netw 5(01):13–26. https://doi.org/10.1142/S0219265904001003

    Article  Google Scholar 

  3. Hsieh SY, Chang YH (2012) Extraconnectivity of \(k\)-ary \(n\)-cube networks. Theor Comput Sci 443:63–69. https://doi.org/10.1016/j.tcs.2012.03.030

    Article  MATH  Google Scholar 

  4. Latifi S, Hegde M, Naraghi-Pour M (1994) Conditional connectivity measures for large multiprocessor systems. IEEE Trans Comput 43(2):218–222. https://doi.org/10.1109/12.262126

    Article  Google Scholar 

  5. Yang WH, Meng JX (2009) Extraconnectivity of hypercubes. Appl Math Lett 22(6):887–891. https://doi.org/10.1016/j.aml.2008.07.016

    Article  MATH  Google Scholar 

  6. Yu XM, Huang XH, Zhang Z (2013) A kind of conditional connectivity of cayley graphs generated by unicyclic graphs. Inf Sci 243:86–94. https://doi.org/10.1016/j.ins.2013.04.011

    Article  MATH  Google Scholar 

  7. Fàbrega J, Fiol MA (1996) On the extraconnectivity of graphs. Discret Math 155(1–3):49–57. https://doi.org/10.1080/00207160.2015.1091070

    Article  MATH  Google Scholar 

  8. Lin CK, Zhang LL, Fan JX, Wang DJ (2016) Structure connectivity and substructure connectivity of hypercubes. Theor Comput Sci 634:97–107. https://doi.org/10.1016/j.tcs.2016.04.014

    Article  MATH  Google Scholar 

  9. Sabir E, Meng JX (2018) Structure fault tolerance of hypercubes and folded hypercubes. Theor Comput Sci 711:44–55. https://doi.org/10.1016/j.tcs.2017.10.032

    Article  MATH  Google Scholar 

  10. Zhang GZ, Lin SW (2019) Path and cycle fault tolerance of bubble-sort graph networks. Theor Comput Sci 779:8–16. https://doi.org/10.1016/j.tcs.2019.01.036

    Article  MATH  Google Scholar 

  11. Pan ZW, Cheng DQ (2020) Structure connectivity and substructure connectivity of the crossed cube. Theor Comput Sci 824:67–80. https://doi.org/10.1016/j.tcs.2020.04.014

    Article  MATH  Google Scholar 

  12. Liu HQ, Cheng DQ (2020) Structure fault tolerance of balanced hypercubes. Theor Comput Sci 845:198–207. https://doi.org/10.1016/j.tcs.2020.09.015

    Article  MATH  Google Scholar 

  13. Li XW, Zhou SM, Ren XY, Guo X (2021) Structure and substructure connectivity of alternating group graphs. Appl Math Comput 391:125639. https://doi.org/10.1016/j.amc.2020.125639

    Article  MATH  Google Scholar 

  14. Lin CK, Cheng E, Lipták L (2020) Structure and substructure connectivity of hypercube-like networks. Parallel Process Lett 30(03):2040007. https://doi.org/10.1142/S0129626420400071

    Article  MATH  Google Scholar 

  15. Li CF, Lin SW, Li SJ (2020) Structure connectivity and substructure connectivity of star graphs. Discret Appl Math 284:472–480. https://doi.org/10.1016/j.dam.2020.04.009

    Article  MATH  Google Scholar 

  16. Dilixiati S, Sabir E, Meng JX (2021) Star structure connectivities of pancake graphs and burnt pancake graphs. Int J Parallel Emerg Distrib Syst 36(5):440–448. https://doi.org/10.1080/17445760.2021.1941006

    Article  Google Scholar 

  17. Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, London

    Book  MATH  Google Scholar 

  18. Biggs NL, White AT (1979) Permutation groups and combinatorial structures. Cambridge University Press, London, p 33

    Book  MATH  Google Scholar 

  19. Akers SB (1987) The Star Graph An Attractive Alternative to the \(n\)-cube. In: Proc. Int’l Conf. on Parallel Processing. IEEE Computer Society Press, Washington, pp 393–400

  20. Akers SB, Krishnamurthy B (1989) A group-theoretic model for symmetric interconnection networks. IEEE Trans Comput 38(4):555–566. https://doi.org/10.1109/12.21148

    Article  MATH  Google Scholar 

  21. Wan M, Zhang Z (2009) A kind of conditional vertex connectivity of star graphs. Appl Math Lett 22(2):264–267. https://doi.org/10.1016/j.aml.2008.03.021

    Article  MATH  Google Scholar 

  22. Cheng E, Lipták L, Shawash N (2008) Orienting cayley graphs generated by transposition trees. Comput Math Appl 55(11):2662–2672. https://doi.org/10.1016/j.camwa.2007.10.016

    Article  MATH  Google Scholar 

  23. Lakshmivarahan S, Jwo JS, Dhall SK (1993) Symmetry in interconnection networks based on cayley graphs of permutation groups a survey. Parallel Comput 19(4):361–407. https://doi.org/10.1016/0167-8191(93)90054-O

    Article  MATH  Google Scholar 

  24. Yang WH, Li HZ, Meng JX (2010) Conditional connectivity of cayley graphs generated by transposition trees. Inf Process Lett 110(23):1027–1030. https://doi.org/10.1016/j.ipl.2010.09.001

    Article  MATH  Google Scholar 

  25. Li SS, Tu JH, Yu CY (2016) The generalized 3-connectivity of star graphs and bubble-sort graphs. Appl Math Comput 274:41–46. https://doi.org/10.1016/j.amc.2015.11.016

    Article  MATH  Google Scholar 

Download references

Acknowledgments

The authors would like to appreciate all anonymous reviewers for their insightful comments and constructive suggestions to polish this paper in high quality.

Funding

This article was completed during the period when the second author Dongqin Cheng was visiting Nanyang Technological University with financial support from China Scholarship Council (CSC No. 202006785015).

Author information

Authors and Affiliations

  1. Department of Mathematics, College of Information Science and Technology / College of Cyberspace Security, Jinan University, Guangzhou, 510632, China

    Kaige Pan & Dongqin Cheng

Authors
  1. Kaige Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dongqin Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All authors contributed to the study conception and design. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Dongqin Cheng.

Ethics declarations

Conflict of interest

The authors have no relevant financial or non-financial interests to disclose.

Code availability

No code.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pan, K., Cheng, D. Star structure connectivity of cayley graphs generated by transposition trees. J Supercomput 79, 4398–4411 (2023). https://doi.org/10.1007/s11227-022-04837-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04837-1

Keywords

Search

Navigation