Abstract
In an NFV network, the availability of resource scheduling can be transformed to the existence of the fractional factor in the corresponding NFV network graph. Researching on the existence of special fractional factors in network structure can help to construct the NFV network with efficient application of resources. Let h: E(G) → [0, 1] be a function. We write \({d}_{G}^{h}(x)=\sum \limits_{e\ni x}h(e)\). We call a graph Fh with vertex set V(G) and edge set Eh a fractional (g, f)-factor of G with indicator function h if \(g(x)\le {d}_{G}^{h}(x)\le f(x)\) holds for any x ∈ V(G), where Eh = {e : e ∈ E(G), h(e) > 0}. We say that G has property E(m, n) with respect to a fractional (g, f)-factor if for any two sets of independent edges M and N with ∣M∣ = m, ∣N∣ = n, and \(M\cap N=\varnothing \), G admits a fractional (g, f)-factor Fh with h(e) = 1 for any e ∈ M and h(e) = 0 for any e ∈ N. The concept of property E(m, n) with respect to a fractional (g, f)-factor corresponds to the structure of an NFV network where certain channels are occupied or damaged in some period of time. In this paper, we consider the resource scheduling problem in NFV networks using graph theory, and show a neighborhood union condition for a graph to have property E(1, n) with respect to a fractional (g, f)-factor. Furthermore, it is shown that the lower bound on the neighborhood union condition in the main result is the best possible in some sense.
Similar content being viewed by others
References
Bondy, J.A. and Murty, U.S.R., Graph Theory, Berlin: Springer, 2008.
Anstee, R.P., An Algorithmic Proof of Tutte’s f-Factor Theorem, J. Algorithms, 1985, vol. 6, no. 1, pp. 112–131.
Liu, G. and Zhang, L., Fractional (g, f)-Factors of Graphs, Acta Math. Sci. Ser. B (Engl. Ed.), 2001, vol. 21, no. 4, pp. 541–545.
Li, Z., Yan, G., and Zhang, X., On Fractional (g, f)-Covered Graphs, OR Trans. (in Chinese), 2002, vol. 6, no. 4, pp. 65–68.
Iida, T. and Nishimura, T., Neighborhood Conditions and k-Factors, Tokyo J. Math., 1997, vol. 20, no. 2, pp. 411–418.
Zhou, S. and Liu, H., Neighborhood Conditions and Fractional k-Factors, Bull. Malays. Math. Sci. Soc. (2), 2009, vol. 32, no. 1, pp. 37–45.
Liu, H. and Lu, H., A Degree Condition for a Graph to Have (a, b)-Parity Factors, Discrete Math., 2018, vol. 341, no. 1, pp. 244–252.
Plummer, M.D., Graph Factors and Factorization: 1985–2003: A Survey, Discrete Math., 2007, vol. 307, no. 7–8, pp. 791–821.
Zhou, S., Remarks on Orthogonal Factorizations of Digraphs, Int. J. Comput. Math., 2014, vol. 91, no. 10, pp. 2109–2117.
Zhou, S., Some Results about Component Factors in Graphs, RAIRO Oper. Res., 2019, vol. 53, no. 3, pp. 723–730.
Zhou, S. and Sun, Z., Binding Number Conditions for P≥2-Factor and P≥3-Factor Uniform Graphs, Discrete Math., 2020, vol. 343, no. 3, Article 111715 (6 pp.).
Zhou, S.Z. and Sun, Z.R., Some Existence Theorems on Path Factors with Given Properties in Graphs, Acta Math. Sin. (Engl. Ser.), 2020, vol. 36, no. 8, pp. 917–928.
Zhou, S., Sun, Z., and Liu, H. ,Sun Toughness and P≥3-Factors in Graphs, Contrib. Discrete Math., 2019, vol. 14, no. 1, pp. 167–174.
Sun, Z. and Zhou, S., A Generalization of Orthogonal Factorizations in Digraphs, Inform. Process. Lett., 2018, vol. 132, pp. 49–54.
Zhou, S., Zhang, T., and Xu, Z., Subgraphs with Orthogonal Factorizations in Graphs, Discrete Appl. Math., 2020, vol. 286, pp. 29–34.
Zhou, S., Remarks on Path Factors in Graphs, RAIRO. Oper. Res., 2020, vol. 54, no. 6, pp. 1827–1834.
Zhou, S., Yang, F., and Xu, L., Two Sufficient Conditions for the Existence of Path Factors in Graphs, Sci. Iran. D: Comput. Sci. Eng. Electr. Eng., 2019, vol. 26, no. 6, pp. 3510–3514.
Cai, J., Wang, X., and Yan, G., A Note on the Existence of Fractional f-Factors in Random Graphs, Acta Math. Appl. Sin. Engl. Ser., 2014, vol. 30, no. 3, pp. 677–680.
Gao, W., Guirao, J.L.G., and Wu, H., Two Tight Independent Set Conditions for Fractional (g, f, m)-Deleted Graphs Systems, Qual. Theory. Dyn. Syst., 2018, vol. 17, no. 1, pp. 231–243.
Gao, W., Guirao, J.L.G., and Chen, Y.J., A Toughness Condition for Fractional (k, m)-Deleted Graphs Revisited, Acta Math. Sin. (Engl. Ser.), 2019, vol. 35, no. 7, pp. 1227–1237.
Gao, W., Wang, W., and Dimitrov, D., Toughness Condition for a Graph to Be All Fractional (g, f, n)-Critical Deleted, Filomat., 2019, vol. 33, no. 9, pp. 2735–2746.
Lv, X., A Degree Condition for Fractional (g, f, n)-Critical Covered Graphs, AIMS Math., 2020, vol. 5, no. 2, pp. 872–878.
Wu, J., Yuan, J., and Siddiqui, M.K., Independent Set Conditions for All Fractional \((g,f,n^{\prime} ,m)\)-Critical Deleted NFV Networks, J. Intell. Fuzzy Syst., 2018, vol. 35, no. 4, pp. 4495–4502.
Yuan, Y. and Hao, R.-X., A Degree Condition for Fractional [a, b]-Covered Graphs, Inform. Process. Lett., 2019, vol. 143, pp. 20–23.
Yuan, Y. and Hao, R.-X., Toughness Condition for the Existence of All Fractional (a, b, k)-Critical Graphs, Discrete Math., 2019, vol. 342, no. 8, pp. 2308–2314.
Zhou, S., Sun, Z., and Ye, H., A Toughness Condition for Fractional (k, m)-Deleted Graphs, Inform. Process. Lett., 2013, vol. 113, no. 8, pp. 255–259.
Zhou, S., Liu, H., and Xu, Y., Binding Numbers for Fractional (a, b, k)-Critical Covered Graphs, Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci., 2020, vol. 21, no. 2, pp. 115–121.
Zhou, S., Xu, L., and Xu, Z., Remarks on Fractional ID-k-Factor-Critical Graphs, Acta Math. Appl. Sin. Engl. Ser., 2019, vol. 35, no. 2, pp. 458–464.
Zhou, S., Xu, Y., and Sun, Z., Degree Conditions for Fractional (a, b, k)-Critical Covered Graphs, Inform. Process. Lett., 2019, vol. 152, Article 105838 (5 pp.).
Acknowledgments
The authors would like to thank the reviewers for their constructive comments in improving the quality of this paper.
Funding
This work is supported by the Six Talent Peaks Project in Jiangsu Province, China, grant no. JY-022.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhou, S., Sun, Z. & Pan, Q. A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs. Probl Inf Transm 56, 332–344 (2020). https://doi.org/10.1134/S0032946020040043
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946020040043