Two new sufficient conditions for hamiltonian claw free graphs are given. Some known results become corollaries of the conclusion, the conditions of theorem are the best possible in a sense.
A k-regular spanning subgraph of graph G is called a k-factor of G. Graph G is called a k-deleted graph if G-e has a k-factor for each edge e. A graph G=(X,Y) with bipartition (X,Y) is called a bipartite graph if ever...A k-regular spanning subgraph of graph G is called a k-factor of G. Graph G is called a k-deleted graph if G-e has a k-factor for each edge e. A graph G=(X,Y) with bipartition (X,Y) is called a bipartite graph if every edge of G has one endpoint in X and the other in Y.It is proved that a bipartite graph G=(X,Y) with X=Y is a k-deleted graph if and only if kS≤r 1+2r 2+...+k(r k+...+r Δ)-ε(S) for all SX. Using this result we give a sufficient neighborhood condition for a bipartite to be a k-deleted graph.展开更多
Model integration is an important section of the model management research area. The paper puts forward a formalization representation of model, and presents some concepts, such as the compound model re- lation, the c...Model integration is an important section of the model management research area. The paper puts forward a formalization representation of model, and presents some concepts, such as the compound model re- lation, the composite model and so on. Additionally, the existence of model integration is also analyzed in de- tail and several sufficient conditions are proved.展开更多
Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has ｜N(u)∩N(v)｜≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12,...Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has ｜N(u)∩N(v)｜≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12, then G is a Hamilton connected graph.展开更多
This paper establishes some suffcient conditions for the lower semicontinuity of the effcient solution mapping for the semi-infinite vector optimization problem with perturbations of both the objective function and th...This paper establishes some suffcient conditions for the lower semicontinuity of the effcient solution mapping for the semi-infinite vector optimization problem with perturbations of both the objective function and the constraint set in normed linear spaces. The constraint set is the set of weakly effcient solutions of vector equilibrium problem, and perturbed by the perturbation of the criterion mapping to the vector equilibrium problem.展开更多
文摘Two new sufficient conditions for hamiltonian claw free graphs are given. Some known results become corollaries of the conclusion, the conditions of theorem are the best possible in a sense.
文摘A k-regular spanning subgraph of graph G is called a k-factor of G. Graph G is called a k-deleted graph if G-e has a k-factor for each edge e. A graph G=(X,Y) with bipartition (X,Y) is called a bipartite graph if every edge of G has one endpoint in X and the other in Y.It is proved that a bipartite graph G=(X,Y) with X=Y is a k-deleted graph if and only if kS≤r 1+2r 2+...+k(r k+...+r Δ)-ε(S) for all SX. Using this result we give a sufficient neighborhood condition for a bipartite to be a k-deleted graph.
基金Supported by the National Natural Science Foundationof China (No.60474041).
文摘Model integration is an important section of the model management research area. The paper puts forward a formalization representation of model, and presents some concepts, such as the compound model re- lation, the composite model and so on. Additionally, the existence of model integration is also analyzed in de- tail and several sufficient conditions are proved.
文摘Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has ｜N(u)∩N(v)｜≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12, then G is a Hamilton connected graph.
基金supported by the National Natural Science Foundation of China under Grant Nos.1106102311201216and 11471291
文摘This paper establishes some suffcient conditions for the lower semicontinuity of the effcient solution mapping for the semi-infinite vector optimization problem with perturbations of both the objective function and the constraint set in normed linear spaces. The constraint set is the set of weakly effcient solutions of vector equilibrium problem, and perturbed by the perturbation of the criterion mapping to the vector equilibrium problem.
