排序方式： 共有1条查询结果，搜索用时 0 毫秒
1
1.
1 IntroductionIn this paper we con8ider finite undirected simple graphs. Let G be a graph with vertexset V(G) and edge set E(G). Let g and f be two po8itive iuteger-valued functions defined onV(G) such that g(x) 5 f(x) for every vertex x of V(G). Then a (g, f)-factor of G is a spanningsubgraph H of G satisfying g(x) 5 dH(x) 5 f(x) for each x E V(H). In particular, if G itselfis a (g, f)-factor, then G is called a (g, f)-grapl1. A subgrapl1 H of G is called an rmsubgraphif H has m edg… 相似文献
1