Feasibility of data transmission under attack: from isolated toughness variant perspective. (English. Russian original) Zbl 1530.94009
Probl. Inf. Transm. 59, No. 2, 146-162 (2023); translation from Probl. Peredachi Inf. 59, No. 2, 83-101 (2023).
Summary: 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.
MSC:
| 94A15 | Information theory (general) |
| 05C90 | Applications of graph theory |
| 05C82 | Small world graphs, complex networks (graph-theoretic aspects) |
Keywords:
information theory; network; isolated toughness variant; fractional \((a, b, n)\)-critical graphReferences:
| [1] | Zhou, S.; Liu, H.; Xu, Y., A Note on Fractional ID-[a,b]-Factor-Critical Covered Graphs, Discrete Appl. Math., 319, 511-516 (2022) · Zbl 1494.05103 · doi:10.1016/j.dam.2021.03.004 |
| [2] | Zhou, S.; Wu, J.; Bian, Q., On Path-Factor Critical Deleted (or Covered) Graphs, Aequationes Math., 96, 4, 795-802 (2022) · Zbl 1520.05081 · doi:10.1007/s00010-021-00852-4 |
| [3] | Zhou, S.; Wu, J.; Liu, H., Independence Number and Connectivity for Fractional (a,b,k)-Critical Covered Graphs, RAIRO Oper. Res., 56, 4, 2535-2542 (2022) · Zbl 1497.05226 · doi:10.1051/ro/2022119 |
| [4] | Gao, W.; Wang, W., New Isolated Toughness Condition for Fractional (g,f,n)-Critical Graphs, Colloq. Math., 147, 55-66 (2017) · Zbl 1358.05228 · doi:10.4064/cm6713-8-2016 |
| [5] | Woodall, D. R., The Binding Number of a Graph and Its Anderson Number, J. Combin. Theory Ser. B, 15, 3, 225-255 (1973) · Zbl 0253.05139 · doi:10.1016/0095-8956(73)90038-5 |
| [6] | Chvátal, V., Tough Graphs and Hamiltonian Circuits, Discrete Math., 5, 3, 215-228 (1973) · Zbl 0256.05122 · doi:10.1016/0012-365X(73)90138-6 |
| [7] | Enomoto, H., Toughness and the Existence of k-Factors. III, Discrete Math., 189, 1-3, 277-282 (1998) · Zbl 0955.05085 · doi:10.1016/S0012-365X(98)00059-4 |
| [8] | Yang, J.; Ma, Y.; Liu, G., Fractional (g,f)-Factors of Graphs, Appl. Math. J. Chinese Univ. Ser. A (Chinese), 16, 4, 385-390 (2001) · Zbl 0991.05087 |
| [9] | Ma, Y.; Liu, G., Isolated Toughness and the Existence of Fractional Factors, Acta Math. Appl. Sin. (Chinese), 26, 1, 133-140 (2003) · Zbl 1016.05049 |
| [10] | He, Z.; Liang, L.; Gao, W., Isolated Toughness Variant and Fractional k-Factor, RAIRO Oper. Res., 56, 5, 3675-3688 (2022) · Zbl 1502.05203 · doi:10.1051/ro/2022177 |
| [11] | Gao, W.; Wang, W.; Zheng, L., Fuzzy Fractional Factors in Fuzzy Graphs, Int. J. Intell. Syst., 37, 11, 9886-9903 (2022) · doi:10.1002/int.23019 |
| [12] | Gao, W.; Wang, W.; Chen, Y., Tight Isolated Toughness Bound for Fractional (k,n)-Critical Graphs, Discrete Appl. Math., 322, 194-202 (2022) · Zbl 1498.05079 · doi:10.1016/j.dam.2022.08.028 |
| [13] | Zhou, S., A Neighborhood Union Condition for Fractional (a,b,k)-Critical Covered Graphs, Discrete Appl. Math., 323, 343-348 (2022) · Zbl 1502.05209 · doi:10.1016/j.dam.2021.05.022 |
| [14] | Zhang, W.; Wang, S., Discussion on Fractional (a,b,k)-Critical Covered Graphs, Acta Math. Appl. Sin. Engl. Ser., 38, 2, 304-311 (2022) · Zbl 1486.05252 · doi:10.1007/s10255-022-1076-6 |
| [15] | Gao, W.; Wang, W.; Chen, Y., Isolated Toughness and Fractional (a,b,n)-Critical Graphs, Connect. Sci., 35, 1, 15 (2023) · doi:10.1080/09540091.2023.2181482 |
| [16] | Bondy, J. A.; Mutry, U. S.R., Graph Theory (2008), Berlin: Springer, Berlin · Zbl 1134.05001 · doi:10.1007/978-1-84628-970-5 |
| [17] | Liu, S., On Toughness and Fractional (g,f,n)-Critical Graphs, Inform. Process Lett., 110, 10, 378-382 (2010) · Zbl 1228.05241 · doi:10.1016/j.ipl.2010.03.005 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
