Toughness condition for a graph to be all fractional (g,f,n)-critical deleted-Reference-Cited by-同舟云学术

Toughness condition for a graph to be all fractional (g,f,n)-critical deleted

Published:2019 Issue:9 Volume:33 Page:2735-2746
ISSN:0354-5180
Container-title:Filomat
language:en
Short-container-title:Filomat

Author:

Gao Wei¹,Wang Weifan²,Dimitrov Darko³

Affiliation:

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

2. Department of Mathematics, Zhejiang Normal University, Jinhua, China

3. Information Studies, Novo Mesto, Slovenia

Abstract

In data transmission networks, the feasibility of data transmission can be characterized by the existence of fractional factors. If some channels and stations are not available in the transmission network at the moment, the possibility of transmission between data is characterized by whether the corresponding graph structure of the network is critical deleted. Toughness used to measure the vulnerability and robustness of a network, which is an important parameter to be considered in network designing. In this paper, we mainly study the relationship between toughness and the all fractional critical deleted graph, and a toughness condition for a graph to be all fractional (g,f,n)-critical deleted is determined.

Publisher

National Library of Serbia

Subject

General Mathematics

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A sufficient condition for a graph to be fractional (k,n)-critical;Discrete Mathematics;2024-06

2. Stability Analysis of Binary Wing Flutter Based on Cyclic Symmetry Algorithm in Internet of Things Environment;Journal of Testing and Evaluation;2024-05-01

3. Isolated toughness for fractional (2;b;k)-critical covered graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2023-11-15

4. Tight Toughness, Isolated Toughness and Binding Number Bounds for the [1,n]-Factors and the {K2,Ci≥4}-Factors;Journal of Interconnection Networks;2023-06-21

5. Forbidden Restrictions and the Existence of $P_{\geq 2}$ -Factor and $P_{\geq 3}$ -Factor;Journal of Function Spaces;2023-04-26