Skip to content
naulon

Not checkedNot checked for notices yet.

Parameters and fractional factors in different settings

Wei Gao, Juan L. G. Guirao

Journal of Inequalities and Applications · 2019

doi:10.1186/s13660-019-2106-7 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Abstract In computer networks, the feasibility of data transmission can be measured in terms of fractional factor model, and specifically the framework of fractional critical deleted graph can express the setting when certain sites and channels are unavailable at a special time. We study the relationship between some parameters in graphs and the existence of fractional (g,f) $(g,f)$-factor in various settings here. Our main contributions are three-fold: first, a connectivity condition for a graph to be fractional (g,f,n′,m) $(g,f,n',m)$-critical deleted is determined; second, the relationship between independence number and fractional ID- (g,f,m) $(g,f,m)$-deleted graphs is studied; third, an isolated toughness bound for fractional (g,f) $(g,f)$-factors is given in balanced bipartite graph setting. Furthermore, by showing counterexamples we explain that bounds for parameters are tight in some sense, and corresponding conditions in all fractional factor settings are discussed as well. Finally, two open problems are proposed for future research.

Abstract licence: CC BY-NC-ND

References41

    40 more references, whose wording the paper’s licence keeps private.

    All 41 references

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.