نتایج جستجو برای: defining set
تعداد نتایج: 720413 فیلتر نتایج به سال:
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
A defining set of a t-(v,k,λ ) design is a subcollection of the block set of the design which is not contained in any other design with the same parameters. A defining set is said to be minimal if none of its proper subcollections is a defining set. A defining set is said to be smallest if no other defining set has a smaller cardinality. A t-(v,k,λ ) design D = (V,B) is called a full design if ...
In this paper, we study the concept of S-approximation spaces in fuzzy set theory and investigate its properties. Along introducing three pairs of lower and upper approximation operators for fuzzy S-approximation spaces, their properties under different assumptions, e.g. monotonicity and weak complement compatibility are studied. By employing two thresholds for minimum acceptance accuracy and m...
This paper describes the application of a framework for text analysis to the problem of distinguishing unusual or non-standard usage of words in large corpora. The need to identify such novel uses, and augment machine-readable dictionaries is a constant battle for professional lexicographers that need to update their resources in order to keep up with the development of the dynamic and evolving...
in this manuscript, we study the inverse problem for non self-adjoint sturm--liouville operator $-d^2+q$ with eigenparameter dependent boundary and discontinuity conditions inside a finite closed interval. by defining a new hilbert space and using its spectral data of a kind, it is shown that the potential function can be uniquely determined by part of a set of values of eigenfunctions at som...
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
In this manuscript, we study the inverse problem for non self-adjoint Sturm--Liouville operator $-D^2+q$ with eigenparameter dependent boundary and discontinuity conditions inside a finite closed interval. By defining a new Hilbert space and using its spectral data of a kind, it is shown that the potential function can be uniquely determined by part of a set of values of eigenfunctions at som...
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We define a minimal defining set to be a defining set which does not properly contain another defining set. If G is a uniquely vertex colorable graph, clearly its minimum defining sets are of size χ(G) − 1. It is shown that...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید