By using function one direction S-rough sets,the concept of F-interior hiding image is presented; the theorem of F-interior hiding and the recognition criteria of interior hiding are proposed; and the applications of ...By using function one direction S-rough sets,the concept of F-interior hiding image is presented; the theorem of F-interior hiding and the recognition criteria of interior hiding are proposed; and the applications of F-interior hiding image are given. F-interior hiding image is a new application area of function S-rough sets,and function S-rough sets is a new theory and new tools for iconology research.展开更多
Let G be a graph, and g and f be integer valued functions defined on V(G) which satisfy g(x)≤f(x) and g(x)≡f(x)(mod 2) for all x∈V(G). Then a spanning subgraph F of G is called a {g,g+2,…,f} -factor if deg_F(x)∈{...Let G be a graph, and g and f be integer valued functions defined on V(G) which satisfy g(x)≤f(x) and g(x)≡f(x)(mod 2) for all x∈V(G). Then a spanning subgraph F of G is called a {g,g+2,…,f} -factor if deg_F(x)∈{g(x),g(x)+2,…,f(x)} for all x∈V(G), when g(x)=1 for all x∈V(G), such a factor is called (1,f) -odd-factor. We give necessary and sufficient conditions for a graph G to have a {g,g+2,…,f} -factor and a (1,f) -odd-factor which contains an arbitrarily given edge of G, from that we derive some interesting results.展开更多
基金Natural Science Foundation of Fujian Province of China ( No.2009J01293)The Open Project of Brain-like Key Laboratory of Fujian Province of China (No. BLISSOS20101015)
文摘By using function one direction S-rough sets,the concept of F-interior hiding image is presented; the theorem of F-interior hiding and the recognition criteria of interior hiding are proposed; and the applications of F-interior hiding image are given. F-interior hiding image is a new application area of function S-rough sets,and function S-rough sets is a new theory and new tools for iconology research.
文摘Let G be a graph, and g and f be integer valued functions defined on V(G) which satisfy g(x)≤f(x) and g(x)≡f(x)(mod 2) for all x∈V(G). Then a spanning subgraph F of G is called a {g,g+2,…,f} -factor if deg_F(x)∈{g(x),g(x)+2,…,f(x)} for all x∈V(G), when g(x)=1 for all x∈V(G), such a factor is called (1,f) -odd-factor. We give necessary and sufficient conditions for a graph G to have a {g,g+2,…,f} -factor and a (1,f) -odd-factor which contains an arbitrarily given edge of G, from that we derive some interesting results.
