{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:47:01Z","timestamp":1777704421137,"version":"3.51.4"},"reference-count":17,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2018,10,27]]},"abstract":"<jats:p>\n                    In the 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 the efficient application of resources. The concept of fractional (\n                    <jats:italic>g<\/jats:italic>\n                    ,\n                    <jats:italic>f<\/jats:italic>\n                    ,\n                    <jats:italic>n<\/jats:italic>\n                    \u2032,\n                    <jats:italic>m<\/jats:italic>\n                    )-critical deleted graph is corresponding to the structure of NFV network where certain sites and channels are occupied in some period of time. In this paper, we present several sharp degree conditions for a graph to be an all fractional (\n                    <jats:italic>g<\/jats:italic>\n                    ,\n                    <jats:italic>f<\/jats:italic>\n                    ,\n                    <jats:italic>n<\/jats:italic>\n                    \u2032,\n                    <jats:italic>m<\/jats:italic>\n                    )-critical deleted graph. These results extend the corresponding conclusions raised in Gao et al. [\n                    <jats:xref ref-type=\"bibr\">9<\/jats:xref>\n                    ].\n                  <\/jats:p>","DOI":"10.3233\/jifs-169767","type":"journal-article","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T13:53:28Z","timestamp":1540907608000},"page":"4487-4494","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph-based feasibility analysis of resource dispatching in NFV networks"],"prefix":"10.1177","volume":"35","author":[{"given":"Jianzhang","family":"Wu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}]},{"given":"Jiabin","family":"Yuan","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}]},{"given":"Darko","family":"Dimitrov","sequence":"additional","affiliation":[{"name":"Hochschule f\u00fcr Technik und Wirtschaft Berlin, Germany"}]}],"member":"179","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.02.006"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1155\/2014-369798"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10114-014-2629-2"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.4064\/cm6713-8-2016"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.4064\/cm6959-8-2016"},{"key":"e_1_3_2_7_2","first-page":"295","article-title":"Toughness and fractional critical deleted graph","volume":"98","author":"Gao W.","year":"2015","unstructured":"GaoW. and WangW.F., Toughness and fractional critical deleted graph, Utilitas Mathematica98 (2015), 295\u2013310.","journal-title":"Utilitas Mathematica"},{"key":"e_1_3_2_8_2","first-page":"225","article-title":"A neighborhood union condition for fractional (k;m)-deleted graphs","volume":"113","author":"Gao W.","year":"2014","unstructured":"GaoW. and WangW.F., A neighborhood union condition for fractional (k;m)-deleted graphs, Ars Combinatoria113 (2014), 225\u2013233.","journal-title":"Ars Combinatoria"},{"key":"e_1_3_2_9_2","article-title":"Two tight independent set conditions for fractional (g, f, m)-deleted graphs systems","author":"Gao W.","unstructured":"GaoW.,GuiraoJ.L.G. and WuH.L., Two tight independent set conditions for fractional (g, f, m)-deleted graphs systems, Qualitative Theory of Dynamical SystemsDOI: 10.1007\/s12346-016-0222-z.","journal-title":"Qualitative Theory of Dynamical Systems"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s40840-015-0194-1"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.4134\/JKMS.2014.51.1.055"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2015.11.035"},{"key":"e_1_3_2_13_2","first-page":"303","article-title":"An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs","volume":"105","author":"Gao W.","year":"2017","unstructured":"GaoW.,LiangL. and ChenY.H., An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs, Utilitas Mathematica105 (2017), 303\u2013316.","journal-title":"Utilitas Mathematica"},{"key":"e_1_3_2_14_2","first-page":"377","article-title":"A sufficient condition for a graph to be fractional (a, b, n)-critical deleted graph","volume":"119","author":"Gao W.","year":"2015","unstructured":"GaoW., A sufficient condition for a graph to be fractional (a, b, n)-critical deleted graph, Ars Combinatoria119 (2015), 377\u2013390.","journal-title":"Ars Combinatoria"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.21042\/AMNS.2016.2.00047"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.21042\/AMNS.2017.2.00044"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.21042\/AMNS.2017.2.00046"},{"key":"e_1_3_2_18_2","article-title":"Neighborhood condition for all fractional (g, f, n\u2019, m)-critical deleted graphs","author":"Gao W.","unstructured":"GaoW.,ZhangY.Q. and ChenY.J., Neighborhood condition for all fractional (g, f, n\u2019, m)-critical deleted graphs, Open Physics, In press.","journal-title":"Open Physics"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169767","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-169767","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:11Z","timestamp":1777455671000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-169767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10,27]]}},"alternative-id":["10.3233\/JIFS-169767"],"URL":"https:\/\/doi.org\/10.3233\/jifs-169767","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,23]]}}}