共查询到20条相似文献，搜索用时 718 毫秒
1.
For an arbitrary subset P of the reals, a function f ： V →P is defined to be a P-dominating function of a graph G = （V, E） if the sum of its function values over any closed neighbourhood is at least 1. That is, for every v ∈ V, f（N[v]） ≥ 1. The definition of total P-dominating function is obtained by simply changing ‘closed＇ neighborhood N[v] in the definition of P-dominating function to ‘open＇ neighborhood N（v）. The （total） P-domination number of a graph G is defined to be the infimum of weight w（f） = ∑v ∈ V f（v） taken over all （total） P-dominating function f. Similarly, the P-edge and P-star dominating functions can be defined. In this paper we survey some recent progress on the topic of dominating functions in graph theory. Especially, we are interested in P-, P-edge and P-star dominating functions of graphs with integer values. 相似文献
2.
图的符号全划分数 总被引：1，自引：0，他引：1
Let G = （V, E） be a graph, and let f ： V →{-1, 1} be a two-valued function. If ∑x∈N（v） f（x） ≥ 1 for each v ∈ V, where N（v） is the open neighborhood of v, then f is a signed total dominating function on G. A set {fl, f2,… fd} of signed d total dominating functions on G with the property that ∑i=1^d fi（x） ≤ 1 for each x ∈ V, is called a signed total dominating family （of functions） on G. The maximum number of functions in a signed total dominating family on G is the signed total domatic number on G, denoted by dt^s（G）. The properties of the signed total domatic number dt^s（G） are studied in this paper. In particular, we give the sharp bounds of the signed total domatic number of regular graphs, complete bipartite graphs and complete graphs. 相似文献
3.
图的整数值控制函数 总被引：1，自引：0，他引：1
For an arbitrary subset P of the reals,a function f:V→P is defined to be a P-dominating function of a graph G=(V,E) if the sum of its function values over any closed neighbourhood is at least 1.That is,for every v∈V, f(N[v])≥1.The definition of total P-dominating function is obtained by simply changing‘closed’neighborhood N[v]in the definition of P-dominating function to‘open’neighborhood N(v).The (total) P-domination number of a graph G is defined to be the infimum of weight w(f) =∑_(v∈V)f(v) taken over all (total) P-dominating function f.Similarly,the P-edge and P-star dominating functions can be defined.In this paper we survey some recent progress oil the topic of dominating functions in graph theory.Especially,we are interested in P-,P-edge and P-star dominating functions of graphs with integer values. 相似文献
4.
1IntroductionQuite a lot of mathematical problems can be pre-sented in the formAx=y,(1.1)whereAis a mapping from a distance spaceXintoanother distance spaceY.For a given effecty,weshould find its causex.Because this equationis oftenill-posed[1],regularization methods should be used tosolve it.Among those methods the most popular onesperhaps are the Tikhonov regularization method[2]anditerative Tikhnov method[2].In Ref.[4,5],the au-thors put forward a new method called A-smooth regu-larizat… 相似文献
5.
Abstract It was shown that a uniquely vertex k-colorable graph of order n has minimum size n（k - 1） - （^k2）, and a uniquely vertex 3-colorable extremal graph with the minimum degree 3 can be constructed. In this note, we construct-an infinite familyof uniquely vertex k-colorable graphs of the order n, the size n（k - 1） - （^k2） and the minimum degree k by using a recursion method. 相似文献
6.
贺云翔 《英语大王(小学)》2014,(3):14-16
Hello, we are redwood trees（红杉树）. We come from America. We are very toll, more than＊ 100 meters tall. We are the tallest trees in the world. Why do we grow＊ so toll？ Because we live a very long time. We can live more than 2 000 years! We live by the sea. The weather there is not 1oo cold or too hot.＊ There is a lot of rain and fog＊ by the sea. We can grow well in rain and fog. In autumn, our leaves will turn red and look very beautiful. Would you like to be our friend？ 相似文献
7.
Let Γd2nbe the set of trees with a given diameter d having a perfect matching,where 2n is the number of vertex.For a tree T in Γd2n,let Pd+1be a diameter of T and q = d m,where m is the number of the edges of perfect matching inPd+1.It can be found that the trees with minimal energy in Γd2nfor four cases q = d 2,d 3,d 4,[d2],and two remarks aregiven about the trees with minimal energy in Γd2nfor2d 33q d 5 and [d2] + 1 q2d 33 1. 相似文献
8.
Given a graph G,a subgraph C is called a clique of G if C is a complete subgraph of G maximal under inclusion and |C|≥2. A clique-transversal set S of G is a set of vertices of G such that S meets all cliques of G. The clique-transversal number, denoted as TC (G), is the minimum cardinality of a clique-transversal set in G. The clique-graph of G, denoted as K (G), is the graph obtained by taking the cliques of G as vertices, and two vertices are adjacent if and only if the corresponding cliques in G have nonempty intersection. Let F be a class of graphs G such that F={G|K(G) is a tree}. In this paper the graphs in F having independent clique-transversal sets are shown and thus TC (G)/|G|≤1/2 for all G ∈ F. 相似文献
9.
In this paper, multiresolution critical-point filters （CPFs） are employed to image matching for frame rate up-conversion （FRUC）. By CPF matching, the dense motion field can be obtained for representing object motions accurately. However, the elastic motion model does not hold in the areas of occlusion, thus resulting in blur artifacts in the interpolated frame. To tackle this problem, we propose a new FRUC scheme using an occlusion refined CPF matching interpolation （ORCMI）. In the proposed approach, the occlusion refinement is based on a bidirectional CPF mapping. And the intermediate frames are generated by the bidirectional interpolation for non-occlusion pixels combined with unidirectional projection for the occlusion pixels. Ex- perimental results show that ORCMI improves the visual quality of the interpolated frames, especially at the occlusion regions. Compared to the block matching based FRUC algorithm, ORCM1 can achieve 1-2 dB PSNR gain for standard video sequences. 相似文献
10.
Reading becomes more and more important in English learning in recent days.If we want to read efficiently,there are a lot of strategies for us to use when read.We can make predictions before reading a passage.When we read,we can read in a sense group.If we do not know the word when we read,we can guess the meaning of the word through the roots,the prefixes,the suffixes.In a word,having lots of practice with suitable reading strategies can enable us to improve our English reading skills. 相似文献
11.
许承德 《上海大学学报(英文版)》2003,7(4):352-357
1 Introduction Ingeneral,wefollowthenotationandterminologyof[1- 5 ].Inthispaperallgraphsaresimple . LetGbeagraph ,V(G)thevertexsetofG ,andE(G)theedgesetofG .Thedistancebetweentwoverticesx ,y∈V(G) ,isdenotedbydG(x ,y) .ThediameterofGisdenotedbyd(G) .Apairofverticesx ,y∈V(G)suchthatdG(x ,y) =d(G)iscalledadiametricalpair.Forx ,y∈V(G) ,ashort (x ,y) pathisan (x ,y) pathwithlength≤d(G ) .ThelengthofapathPisdenotedby|P|.Anedgee∈E(G)iscalledcyclicifthereexistsacycleinGcontaining… 相似文献
12.
许承德 《上海大学学报(英文版)》2005,9(4)
The line persistence of a graph G, p1 (G) is the minimum number of lines which must be removed to increase the diameter of G. In Ref. [ 7 ] ( J. Shanghai Univ., 2003,7(4) :352-357), we gave a characterization of graphs of diameter five with P1 ( G ) ≥ 2. In this paper we will show that each of the 8 special graphs Xi ( i = 1,2,3,4,5,6,7,8 ) listed in condition (2) of Theorem 1 in Ref. [ 7 ] can not be deleted. Therefore the results we obtained in Ref. [ 7 ] can not in general be improved. 相似文献
13.
蒋岳祥 《浙江大学学报(A卷英文版)》2004,5(3):335-342
Suppose {Xi,i≥1} and {Yi, i≥1} are two independent sequences with distribution functions and , respectively. Zi,n is the combination of Xi and Yi with a probability for each I with 1≤ i≤n. The extreme value distribution GZ(x) of this particular triangular array of the i.i.d. Random variables Z1,n,… Z2,n, Zn,n is discussed. We found a new form of the extreme value distributions i)ΦAα1(x)Φα2 and ii) ψAα(x)ψα2(x)α1<α2), which are not max-stable. It occurs if FX and FY belong to the same MDA(Φ) or MDA(Ψ). 相似文献
14.
几乎正则图的全符号控制 总被引：1，自引：2，他引：1
1IntroductionFor notation and graph theory terminology we ingeneral follow[1].LetG=(V,E)be a graph with thevertex setVand the edge setE,andletvbe a vertexinV.The open neighborhood ofvisN(v)={u∈V|uv∈E}and the closed neighborhood ofvisN[v]={v}∪N(v).The d… 相似文献
15.
HAN Jing-wei YU Yao-yong 《浙江大学学报(A卷英文版)》2007,8(6):963-968
In this work, we study the Asanov Finsler metric F=α(β2/α2 gβ/α 1)1/2exp{(G/2)arctan[β/(hα) G/2]}, where α=(αijyiyj)1/2 is a Riemannian metric and β=biyj is a 1-form, g∈(-2,2), h=(1-g2/4)1/2, G=g/h. We give the necessary and sufficient condition for Asanov metric to be locally projectively flat, i.e., α is projectively flat and β is parallel with respect to α. Moreover, we proved that the Douglas tensor of Asanov Finsler metric vanishes if and only if β is parallel with respect to α. 相似文献
16.
The construction of multirate rearrangeable network has long been an interesting problem. Of many results published, all were
achieved on 3-stage Clos network. The monotone routing algorithm proposed by Huet al. (2001) was also first applied to 3-stage Clos network. In this work, we adopt this algorithm and apply it to log
d
(N,m,p) networks. We first analyze the properties of log
d
(N,m,p) networks. Then we use monotone algorithm in log
d
(N,0,p) network. Furthermore we extend the result to construct multirate rearrangeable networks based on log
d
(N,m,p) network (1≤m≤n−1).
Project (No. 10371028) supported by the National Natural Science Foundation of China 相似文献
17.
Zhang Hanlin 《上海大学学报(英文版)》1998,2(3):191-193
１ＩｎｔｒｏｄｕｃｔｉｏｎＤｉｆｅｒｅｎｔｉａｌｅｑｕａｔｉｏｎｓｗｉｔｈｔｕｒｎｉｎｇｐｏｉｎｔｓｅｘｉｓｔｗｉｄｅｌｙｉｎｍａｎｙｐｒｏｂｌｅｍｓｏｆｍａｔｈｅｍａｔｉｃｓｐｈｙｓｉｃｓ,ｓｏｔｈｅｓｅｐｒｏｂｌｅｍｓａｒｅｖｅｒｙｉｍｐｏｒｔａ... 相似文献
18.
Let R be a ring, a ,b ∈ R, ( D , α ) and (G , β ) be two generalized derivations of R . It is proved that if aD ( x ) = G ( x )b for all x ∈ R, then one of the following possibilities holds: (i) If either a or b is contained in C , then α = β= 0 and there exist p , q ∈ Qr ( RC) such that D ( x )= px and G ( x )= qx for all x ∈ R;(ii) If both a and b are contained in C , then either a = b= 0 or D and G are C-linearly dependent;(iii) If neither a nor b is contained in C , then there exist p , q ∈ Qr ( RC) and w ∈ Qr ( R) such that α ( x ) = [ q ,x] and β ( x ) = [ x ,p] for all x ∈ R, whence D ( x )= wx-xq and G ( x )= xp + avx with v ∈ C and aw-pb= 0. 相似文献
19.
蒋岳祥 《浙江大学学报(A卷英文版)》2005,6(4):315-321
The sequences {Zi,n, l≤i≤n}, n≥l have multi-nomial distribution among i.i.d. random variables {X1,i, i≥1}, {X2,i,u≥l }, …, {Xm,i, i≥1 }. The extreme value distribution Gz(x) of this particular triangular array of i.i.d, random variables Z1,n, Z2Zn,n is discussed in this paper. We found a new type of not max-stable extreme value distributions, i) Gz(x) = r-1∏i=1ФAiαi(x) × Фαr (x);ii) Gz (x) = r-1∏i=1ψAiαi (x) × ψαr (x); iii) Gz (x) = r-1∏i=1 ∧Ai (λix) × A(x), r≥2, 0＜α1≤α2≤…≤αr and λi∈ (0,1] for i, l≤i≤r-1 which occur if Fj, …, Fm belong to the same MDA. 相似文献
20.
LU Li-gang YAN Li-tan XIANG Li-chi 《浙江大学学报(A卷英文版)》2007,8(1):158-163
INTRODUCTION Throughout this paper, we shall work with a filtered complete probability space (?,F,(Ft),P) sat-isfying the usual conditions. Let B=(Bt)t≥0 be a stan-dard Brownian motion with B0=0. Denote by ú the set of all non-negative real numbers. Recall that a diffusion process X starting at x≥0 is called the square of a Bessel process of dimension δ>0 if d X t = δd t 2 | X t |d Bt , X 0= x, (1) Clearly, this equation has a unique non-negative strong solution X, i.e., … 相似文献