关键词: NFV网络, 资源调度, 全分数因子, 全分数 $(g,f,n',m)$-临界消去图

Abstract:

In the resource scheduling network, the availability of resource scheduling is equivalent to the existence of the fractional factor in the corresponding network graph. The study on the existence of fractional factors in specific graph structure can help engineers design and  construct the network with efficient use of resources. A graph $G$ is called an all fractional $(g,f,n',m)$-critical deleted graph if after removing any $n'$ vertices from $G$ the remaining graph is still an all fractional $(g,f,m)$-deleted graph. In this paper, we present two binding number conditions for a graph to be an all fractional $(g,f,n',m)$-critical deleted graph, and illustrate the results are sharp with examples.

Key words: NFV network, Resource scheduling, All fractional factor, All fractional $(g,f,n',m)$-critical deleted graph