نتایج جستجو برای: weakly hereditary property
تعداد نتایج: 283162 فیلتر نتایج به سال:
Given a property P of graphs, write Pn for the set of graphs with vertex set [n] having property P. We call |Pn| the speed of P. Recent research has shown that the speed of a monotone or hereditary property P can be a constant, polynomial, or exponential function of n, and the structure of the graphs in P can then be well described. Similarly, |Pn| can be of the form n(1−1/k+o(1))n or 2(1−1/k+o...
The query complexity of graph properties is well-studied when queries are on edges. We investigate the same when queries are on nodes. In this setting a graphG = (V ,E)on n vertices and a propertyP are given. A blackbox access to an unknown subset S ⊆V is provided via queries of the form ‘Does i ∈ S?’. We are interested in the minimum number of queries needed in worst case in order to determine...
In this paper we use a natural forcing to construct a left-separated topology on an arbitrary cardinal κ. The resulting left-separated space Xκ is also 0-dimensional T2, hereditarily Lindelöf, and countably tight. Moreover if κ is regular then d(Xκ) = κ, hence κ is not a caliber of Xκ, while all other uncountable regular cardinals are. This implies that some results of [A] and [JSz] are, consis...
This paper describes an algorithm that determines the minimal sets of variables that determine the values of a discrete partial function. The Apriori-like algorithm is based on the dual hereditary property of determining sets. Experimental results are provided that demonstrate the efficiency of the algorithm for functions with up to 24 variables. The dependency of the number of minimal determin...
We prove that for any additive hereditary property P > O, it is NP-hard to decide if a given graph G allows a vertex partition V (G) = A ∪B such that G[A] ∈ O (i.e., A is independent) and G[B] ∈ P.
A set P of graphs is termed hereditary property if and only if it contains all subgraphs of any graph G belonging to P. A graph is said to be maximal with respect to a hereditary property P (shortly P-maximal) whenever it belongs to P and none of its proper supergraphs of the same order has the property P. A graph is P-extremal if it has a the maximum number of edges among all P-maximal graphs ...
The edit distance between two graphs on the same labeled vertex set is the symmetric difference of the edge sets. The edit distance function of hereditary property, H, is a function of p ∈ [0, 1] and is the limit of the maximum normalized distance between a graph of density p and H. This paper uses localization, for computing the edit distance function of various hereditary properties. For any ...
In the present paper, we study and investigate the properties of fuzzy soft α-connected sets, fuzzy soft α-separated sets and fuzzy soft α-s-connected sets and establish several interesting properties supported by examples. Moreover, we show that, a fuzzy soft α-disconnectedness is not an hereditary property in general. Finally, we show that the fuzzy α-irresolute surjective soft image of fuzzy...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید