共查询到20条相似文献，搜索用时 93 毫秒
1.
图的整数值控制函数 总被引：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. 相似文献
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.
Let G=(V, E)be a simple graph without isolated vertices. For positive integer κ, a 3-valued function f:V → {-1, 0, 1} is said to be a minus total k-subdominating function(MTκSF)if ∑u∈N(u)f(u)≥ 1 for at least κ vertices v in G, where N(v)is the open neighborhood of v. The minus total κ-subdomination number γ-κt(G)equals the minimum weight of an MTkSF on G. In this paper, the values on the minus total κ-subdomination number of some special graphs are investigated. Several lower bounds on γ-κt of general graphs and trees are obtained. 相似文献
4.
《高等教育与学术研究》2007,(3)
A Romam dominating function on a graph G = (V , E) is a function f : V → {0,1,2} satisfying the condition that every vertex v for which f(v)=0 is adjacent to at least one vertex x for which f(x)=2, denoted by f = (V0 , V1 , V2). The weight of a Roman dominating function is the value f(V)=∑v∈V=2n2 n1, where |Vi|= ni (i=0,1,2), the minimum weight of a Ronam dominating function denoted by γ R (G ). In this paper, we give an upper bound of γ R (G ), and at the same time, we answer an open problem posed in [1]. 相似文献
5.
几乎正则图的全符号控制 总被引：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… 相似文献
6.
Let G = （V,A） be a digraph.A set T of vertices of G is a twin dominating set of G if for every vertex v ∈ V ／ T.There exist u,w ∈ T （possibly u = w） such that （u,v）,（v,w） ∈ A.The twin domination number γ＊（G） of G is the cardinality of a minimum twin dominating set of G.In this paper we consider the twin domination number in generalized Kautz digraphs GK（n,d）.In these digraphs,we establish bounds on the twin domination number and give a sufficient condition for the twin domination number attaining the lower bound.We give the exact values of the twin domination numbers by constructing minimum twin dominating sets for some special generalized Kautz digraphs. 相似文献
7.
INTRODUCTION We consider the following nonlinear integerprogramming problem (PI) minf(x), s.t. x∈XI (1)where XI?In is a bounded and closed box set con-taining more than one point; In is the set of integerpoints in Rn. Notice that the formulation in (PI) allows the setXI to be defined by equality constraints as well asinequality constraints. Furthermore, when f(x) is co-ercive, i.e., f(x) → ∞ as ||x||→∞, there always exists abo… 相似文献
8.
WANG Ya-qin 《浙江大学学报(A卷英文版)》2007,8(10):1691-1694
Let K be a closed convex subset of a real reflexive Banach space E, T：K→K be a nonexpansive mapping, and f：K→K be a fixed weakly contractive （may not be contractive） mapping. Then for any t∈（0, 1）, let x1∈K be the unique fixed point of the weak contraction x1→tf（x）＋（1-t）Tx. If T has a fixed point and E admits a weakly sequentially continuous duality mapping from E to E^＊, then it is shown that {xt} converges to a fixed point of T as t→0. The results presented here improve and generalize the corresponding results in （Xu, 2004）. 相似文献
9.
We studied the normality criterion for families of meromorphic functions related to shared sets. Let F be a family of meromorphic functions on the unit disc △, a and b be distinct non-zero values, S={a,b}, and k be a positive integer. If for every f∈ F, i） the zeros of f（z） have a multiplicity of at least k＋ 1, and ii） E^-f（k）（S） lohtain in E^-f（S）, then F is normal on .4. At the same time, the corresponding results of normal function are also proved. 相似文献
10.
无约束全局最优化中的无参数填充函数 总被引：1，自引：0，他引：1
The filled function method is an approach for finding a global minimum of multi-dimensional functions.With more and more relevant research,it becomes a promising way used in unconstrained global optimization.Some filled functions with one or two parameters have already been suggested.However,there is no certain criterion to choose a parameter appropriately.In this paper,a parameter-free filled function was proposed.The definition of the original filled function and assumptions of the objective function given by Ge were improved according to the presented parameter-free filled function.The algorithm and numerical results of test functions were reported.Conclusions were drawn in the end. 相似文献
11.
A physical model of sinusoidal function was established. It is generalized that the force is directly proportional to a power function of the distance in a classical spring-oscillator system. The differential equation of the generalized model was given Simulations were conducted with different power values. The results show that the solution of the generalized equation is a periodic function. The expressions of the amplitude and the period （frequency） of the generalized equation were derived by the physical method. All the simulation results coincide with the calculation results of the derived expressions. A special function also was deduced and proven to be convergent in the theoretical analysis. The limit value of the special function also was derived. The generalized model can be used in solving a type of differential equation and to generate periodic waveforms. 相似文献
12.
LAN Fu-xiang LI Jiang-tao 《重庆大学学报(英文版)》2007,6(4):291-293
We studied the normality conditions in families of meromorphic functions, improved the results of Fang and Zalcman [Fang ML, Zalcman L, Normal families and shared values of meromorphic functions, Computational Methods and Function Theory, 2001, 1 (1): 289-299], and generalized two new normality criterions. Let F be a family of meromorphic functions in a domain D, a a non-zero finite complex number, B a positive real number, and k and m two positive integers satisfying m>2k 4. If every function denoted by f belonging to F has only zeros with multiplicity at least k and satisfies f m(z)f (k)(z)=a??f (k)(z)?≤B or f m(z)f (k)(z)=a??f (z)?≥B, then F is normal in D. 相似文献
13.
We construct the membership functions of the fuzzy objective values of a controllable queueing model, in which cost elements, arrival rate and service rate are all fuzzy numbers. Based on Zadeh＇s extension principle, a set of parametric nonlinear programs is developed to find the upper and lower bounds of the minimal average total cost per unit time at the possibility level. The membership functions of the minimal average total cost are further constructed using different values of the possibility level. A numerical example is solved successfully to illustrate the validity of the proposed approach. Because the object value is expressed and governed by the membership functions, the optimization problem in a fuzzy environment for the controllable queueing models is represented more accurately and analytical results are more useful for system designers and practitioners. 相似文献
14.
段曦盛 《重庆大学学报(英文版)》2003,2(2)
Introduction Let f and g be two meromorphic functions defined in the open complex plane C, and k be a nonnegative integer or infinity. For {}aC违U, denote by (;)kEaf the set of all a-points of f where an a-point of multiplicity m is counted m times if mk and otherwise k+1 times. If (;)(;)kkEafEag=, then, f and g are considered to share the value a with weight k, which is expressed by f and g share (a ,k). Clearly if f and g share (a ,k), then they share (a ,p) for all integer p in 0pk#. It… 相似文献
15.
In fixed order quantity systems,uncertainty in lead time is expressed as a set of scenarios with occurrence probabilities,and the mean and variance in demand distribution are supposed to be changeable according to a known pattern.A new concept of ＂dynamic robust optimal reorder point＂ is proposed in this paper and its value is calculated as a ＂robust optimal reorder point function with respect to reorder time＂.Two approaches were employed in determining the dynamic optimal reorder point.The first is a shortage rate satisfaction approach and the second is a backorder cost minimization approach.The former aims at finding the minimum value of reorder point at each reorder time which satisfies the condition that the cumulative distribution function （CDF） of shortage rate under a given set of scenarios in lead time is greater than or equal to a basic CDF of shortage rate predetermined by a decision-maker.In the latter approach,the CDF of closeness of reorder point is defined at each reorder time to express how close to the optimal reorder points under the set of scenarios,and the dynamic optimal reorder point is defined according to stochastic ordering.Some numerical examples demonstrate the features of these dynamic robust optimal reorder points. 相似文献
16.
Let G be a weighted graph with adjacency matrix A=[aij]. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix D=[d/ij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dij can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for different nuclei.Balasubramanian (1995) computed the Euclidean graphs and their automorphism groups for benzene, eclipsed and staggered forms of ethane and eclipsed and staggered forms of ferroeene. This paper describes a simple method, by means of which it is possible to calculate the automorphism group of weighted graphs. We apply this method to compute the symmetry of tetraammine platinum(Ⅱ) with C2v and C4v point groups. 相似文献
17.
Graph transformation systems have become a general formal modeling language to describe many models in software development process. Behavioral modeling of dynamic systems and model-to-model transformations are only a few examples in which graphs have been used to software development. But even the perfect graph transformation system must be equipped with automated analysis capabilities to let users understand whether such a formal specification fulfills their requirements. In this paper, we present a new solution to verify graph transformation systems using the Bogor model checker. The attributed graph grammars （AGG）-like graph transformation systems are translated to Bandera intermediate representation （BIR）, the input language of Bogor, and Bogor verifies the model against some interesting properties defined by combining linear temporal logic （LTL） and special-purpose graph rules. Experimental results are encouraging, showing that in most cases our solution improves existing approaches in terms of both performance and expressiveness. 相似文献
18.
Dictionary has many functions, in which the function of definition is of very importance because the main purpose of dictionary is providing the entry’s meaning information for the readers so that the readers can understand and use the entry-word and the realization of the purpose completely depends on lexicographical definition. However, the function of definition is limited, which need the exemplification to assist it. Therefore, the exemplification becomes very important, too. Good exemplification can assist definition, provide grammatical information, and supplement the information usage and so on. Many researches studied the exemplification of dictionary, its principles and so on. Dictionary changed much with the development of technology and many kinds of electronic dictionaries appeared. Few studies are involved with the new-type dictionary. Based on the general principles of the exemplification in a learner’s printed dictionary, it is necessary to construct the general principles about the exemplification in the electronic learner’s dictionary. 相似文献
19.
Ramanujan sums （RS） and their Fourier transforms have attracted more and more attention in signal processing in recent years. Due to their non-periodic and non-uniform spectrum, RS are widely used in low-frequency noise processing, Doppler spectrum estimation and time-frequency analysis. However, the traditional method for calculating RS values is rather complex since it requires two numbers＇ factorization in two arithmetic functions. For a length-n vector, its Ramanujan-Fourier transform usually involves a series of RS values which will occupy O（n2） memory units. Thus, in this paper an approach based on prime-composition is proposed to reduce the complexity of RS calculation to O（n）. Meanwhile, the complexity of Ramanujan-Fourier transform can be further reduced from O（n2） to O（n In（In（n））） . 相似文献
20.
Urban wastewater treatment techniques could not be applied to improve the pollutant removal efficiency,due to its characteristics of closed and quiescent conditions of the static lake water.In this study,natural zeolite and coal cinder were chosen as filler compounds of the ecological filter.Static and dynamic experiments were carried out to study the remediation efficiency.Experimental data show that removal efficiency of ammonia nitrogen （NH ＋ 4 -N） reaches 85% in both static and dynamic patterns and its removal efficiency reaches 97% when the recycling period is 1 h in dynamic condition.The maximum removal efficiency of nitrite nitrogen （NO-2 -N） reached 98%,and the removal efficiency of total nitrogen （TN） is a maximum of 84%.The final effluent concentration of total phosphorus （TP） is 0.079 mg/L.Effluent recycling could improve the nutrient （N,P） removal efficiently.Dissolved oxygen （DO） concentration could remain high with the water cycling.The filter works efficiently on regulating pH to the standard level of healthy water. 相似文献