Skip to main content
SpringerLink
Log in

Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective

  • COMMUNICATION NETWORK THEORY
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

The graph model is an appreciable tool for data transmission network, where the feasibility of data transmission in site attack circumstances can be described by fractional critical graphs, and the vulnerability of networks can be measured by isolation toughness variant. This paper considers both the stability of the network and the feasibility of data transmission when the sites are destroyed, and determines the isolated toughness variant bound for fractional \((a,b,n)\)-critical graphs, where the parameter \(n\) represents the number of damaged sites at a certain moment. A counterexample proves the sharpness of the given isolated toughness variant bound. The main theoretical conclusion provides an equilibrium between performance and cost in network topology designing.

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

References

  1. Zhou, S., Liu, H., and Xu, Y., A Note on Fractional ID-\([a,b]\)-Factor-Critical Covered Graphs, Discrete Appl. Math., 2022, vol. 319, pp. 511–516. https://doi.org/10.1016/j.dam.2021.03.004

    Article  MathSciNet  Google Scholar 

  2. Zhou, S., Wu, J., and Bian, Q., On Path-Factor Critical Deleted (or Covered) Graphs, Aequationes Math., 2022, vol. 96, no. 4, pp. 795–802. https://doi.org/10.1007/s00010-021-00852-4

    Article  MathSciNet  Google Scholar 

  3. Zhou, S., Wu, J., and Liu, H., Independence Number and Connectivity for Fractional \((a,b,k)\)-Critical Covered Graphs, RAIRO Oper. Res., 2022, vol. 56, no. 4, pp. 2535–2542. https://doi.org/10.1051/ro/2022119

    Article  MathSciNet  Google Scholar 

  4. Gao, W. and Wang, W., New Isolated Toughness Condition for Fractional \((g,f,n)\)-Critical Graphs, Colloq. Math., 2017, vol. 147, pp. 55–66. https://doi.org/10.4064/cm6713-8-2016

    Article  MathSciNet  Google Scholar 

  5. Woodall, D.R., The Binding Number of a Graph and Its Anderson Number, J. Combin. Theory Ser. B, 1973, vol. 15, no. 3, pp. 225–255. https://doi.org/10.1016/0095-8956(73)90038-5

    Article  MathSciNet  Google Scholar 

  6. Chvátal, V., Tough Graphs and Hamiltonian Circuits, Discrete Math., 1973, vol. 5, no. 3, pp. 215–228. https://doi.org/10.1016/0012-365X(73)90138-6

    Article  MathSciNet  Google Scholar 

  7. Enomoto, H., Toughness and the Existence of \(k\)-Factors. III, Discrete Math., 1998, vol. 189, no. 1–3, pp. 277–282. https://doi.org/10.1016/S0012-365X(98)00059-4

    Article  MathSciNet  Google Scholar 

  8. Yang, J., Ma, Y., and Liu, G., Fractional \((g,f)\)-Factors of Graphs, Appl. Math. J. Chinese Univ. Ser. A (Chinese), 2001, vol. 16, no. 4, pp. 385–390.

    MathSciNet  Google Scholar 

  9. Ma, Y. and Liu, G., Isolated Toughness and the Existence of Fractional Factors, Acta Math. Appl. Sin. (Chinese), 2003, vol. 26, no. 1, pp. 133–140.

    MathSciNet  Google Scholar 

  10. He, Z., Liang, L., and Gao, W., Isolated Toughness Variant and Fractional \(k\)-Factor, RAIRO Oper. Res., 2022, vol. 56, no. 5, pp. 3675–3688. https://doi.org/10.1051/ro/2022177

    Article  MathSciNet  Google Scholar 

  11. Gao, W., Wang, W., and Zheng, L., Fuzzy Fractional Factors in Fuzzy Graphs, Int. J. Intell. Syst., 2022, vol. 37, no. 11, pp. 9886–9903. https://doi.org/10.1002/int.23019

    Article  Google Scholar 

  12. Gao, W., Wang, W., and Chen, Y., Tight Isolated Toughness Bound for Fractional \((k,n)\)-Critical Graphs, Discrete Appl. Math., 2022, vol. 322, pp. 194–202. https://doi.org/10.1016/j.dam.2022.08.028

    Article  MathSciNet  Google Scholar 

  13. Zhou, S., A Neighborhood Union Condition for Fractional \((a,b,k)\)-Critical Covered Graphs, Discrete Appl. Math., 2022, vol. 323, pp. 343–348. https://doi.org/10.1016/j.dam.2021.05.022

    Article  MathSciNet  Google Scholar 

  14. Zhang, W. and Wang, S., Discussion on Fractional \((a,b,k)\)-Critical Covered Graphs, Acta Math. Appl. Sin. Engl. Ser., 2022, vol. 38, no. 2, pp. 304–311. https://doi.org/10.1007/s10255-022-1076-6

    Article  MathSciNet  Google Scholar 

  15. Gao, W., Wang, W., and Chen, Y., Isolated Toughness and Fractional \((a,b,n)\)-Critical Graphs, Connect. Sci., 2023, vol. 35, no. 1. Article 2181482 (15 pp.). https://doi.org/10.1080/09540091.2023.2181482

    Article  MathSciNet  Google Scholar 

  16. Bondy, J.A. and Mutry, U.S.R., Graph Theory, Berlin: Springer, 2008.

    Book  Google Scholar 

  17. Liu, S., On Toughness and Fractional \((g,f,n)\)-Critical Graphs, Inform. Process Lett., 2010, vol. 110, no. 10, pp. 378–382. https://doi.org/10.1016/j.ipl.2010.03.005

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work has been partially supported by the National Science Foundation of China (grant no. 12161094).

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Yunnan Normal University, Kunming, China

    W. Gao

  2. Department of Mathematics and Science Education, Harran University, Sanliurfa, Turkey

    H. M. Başkonuş

  3. Engineering School (DEIM), University of Tuscia, Viterbo, Italy

    C. Cattani

Authors
  1. W. Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. M. Başkonuş
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Cattani
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Wei Gao wrote an original draft. Hacı Mehmet Başkonuş and Carlo Cattani wrote a review and performed editing. All authors participated in the discussions.

Corresponding author

Correspondence to W. Gao.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Translated from Problemy Peredachi Informatsii, 2023, Vol. 59, No. 2, pp. 83–101. https://doi.org/10.31857/S0555292323020067

Publisher’s Note. Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gao, W., Başkonuş, H.M. & Cattani, C. Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective. Probl Inf Transm 59, 146–162 (2023). https://doi.org/10.1134/S0032946023020060

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946023020060

Keywords

Search

Navigation