Search

By modeling the network structure with a graph, the corresponding data transmission problem can be transformed into a fractional flow problem on the graph. Under certain specific conditions, the transmission path of data is required to pass through certain special channels, thus the corresponding mathematical framework is transformed into the existence of fractional covered graphs under the special network graph structure. In this paper, by means of the necessary and sufficient conditions for fractional (g; f; n';m)- critical covered graphs, we obtain some sufficient conditions on graph parameters of fractional covered graphs. Furthermore, we point out that these results are tight in terms of some counterexamples, and the results have potential guiding value for network designing. [ABSTRACT FROM AUTHOR]

The fractional factor theory of graphs originated from the feasible flow problem in communication networks. With the development of computer networks, this problem has been highly valued by scholars from the field of computer science and mathematics. This paper studies the sufficient conditions for the existence of fractional factors in the different setting of network from a theoretical perspective. These theoretical results provide the basis for the initial network designing. We first study the relationship between vulnerable parameter in networks and the existence of fractional factor, and an isolated toughness condition for a graph to be fractional (g; f; n')- critical is determined. Then, we illustrate some neighborhood union conditions for independent-set-deletable deleted graphs, and point out that the conditions are best in some senses. Moreover, we present an independent set condition for a graph to be fractional ID-(g; f;m)-deleted. Also, the result is tight on independent set degree condition. Finally, we introduce the concept of all fractional ID-(g; f;m)-deleted graph, and several conclusions are obtained from the known results. [ABSTRACT FROM AUTHOR]

The fuzzy membership function has non-collapsability and can be used to characterize uncertainties that cannot be explored by sudden events. As the membership function does not satisfy the complementarity law, a single membership function cannot simultaneously characterize the positive and negative aspects of things. This article considers structured fuzzy data with negative uncertainty information, which is modeled using bipolar fuzzy graphs. On this basis, we consider the connectivity remainder of the model and obtain the corresponding theoretical results. In addition, we have discussed some related fractional factor issues. [ABSTRACT FROM AUTHOR]

In computer network, the structure of network is modelled by a graph, and toughness, as a graph parameter, is employed to detect the vulnerability of the network. A fractional k-factor exists to satisfy h(e) = 1, if for arbitrary e ∈ E(G), graph G is fractional k-covered. This work studies the mutual influence of toughness and fractional fractional k-covered graph, and obtains the result that a graph G is fractional k-covered if t(G) ≥ k - 1/k. This conclusion implies that the best toughness bound for the existence of the fractional k-factor is also the tight t(G) condition of the fractional k-coverage graph. Finally, some extended conclusions are presented. [ABSTRACT FROM AUTHOR]