نتایج جستجو برای: asteroidal sets

تعداد نتایج: 211373  

2007
Qiongsun Liu Cui Ma Xiandong Zhou

The aim of this paper is to point out and correct some errors of two theorems for IFSs in Atanassov (Two theorems for intuitionistic fuzzy sets, Fuzzy Sets and Systems, 2000) and bring forward a new theorem for IFSs. In the end, some elementary, but non-standard equalities between IFSs were formulated.

2007
Steve Rawlings

Using mid-infrared and radio criteria, we select a sample of candidate z ∼ 2 obscured quasars. Optical spectroscopy confirms about half of these as type-2 quasars, and modelling the population suggests 50-80% of the quasars are obscured. We find some flat radio spectrum type-2 quasars, and tentative evidence for obscuration unrelated to the torus. Using a similar sample, we also find evidence f...

Journal: :Discrete Mathematics 2010
Diptendu Bhowmick L. Sunil Chandran

An axis parallel d-dimensional box is the Cartesian product R1×R2×· · ·×Rd where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer d such that G can be represented as the intersection graph of a collection of d-dimensional boxes. An axis parallel unit cube in d-dimensional space or a d-cube is defined as the Cartesian product R1 ...

Journal: :CoRR 2014
Lorna Stewart Richard Anthony Valenzano

Circle graphs are intersection graphs of chords in a circle and kpolygon graphs are the intersection graphs of chords in a convex ksided polygon where each chord has its endpoints on distinct sides. Every k-polygon graph is a circle graph and every circle graph is a kpolygon graph for some k. The polygon number ψ(G) of a circle graph G is the minimum k such that G is a k-polygon graph and the p...

Journal: :Fuzzy Sets and Systems 2010
Lawrence Neff Stout

Fuzzy Sets and Systems 161 (2010) 412-432 Elsevier www.elsevier.com/locate/fss A Categorical Semantics for Fuzzy Predicate Logic

Journal: :Fuzzy Sets and Systems 2008
Michal Baczynski Balasubramaniam Jayaram

does not satisfy (EP), because for x = 0.3, y = 0.5 and z = 0.5 we get I (x, I (y, z)) = 0.7 = 0.5 = I (y, I (x, z)). The corrected last two rows are provided in Table 1 here. In both of these cases the natural negation NI is the classical negation NC(x) = 1 − x. One can easily check that the first function satisfies (I1) and it does not satisfy (EP), because for x = 0.3, y = 1 and z = 0, we ge...

2010
Balasubramaniam Jayaram

In this work we solve an open problem of U.Höhle [Problem 11, Fuzzy Sets and Systems 145 (2004) 471-479]. We show that the solution gives a characterization of all conditionally cancellative t-subnorms. Further, we give an equivalence condition for a conditionally cancellativite t-subnorm to be a t-norm and hence show that conditionally cancellativite t-subnorms whose natural negations are stro...

1999
Jou-Ming Chang Chin-Wen Ho Ming-Tat Ko

In this paper, we study the metric property of LexBFS-ordering on AT-free graphs. Based on a 2-sweep LexBFS algorithm, we show that every AT-free graph admits a vertex ordering, called the strong 2-cocomparability ordering, that for any three vertices u v w in the ordering, if d(u; w) 2 then d(u; v) = 1 or d(v; w) 2. As an application of this ordering, we provide a simple linear time recognitio...

Journal: :Discussiones Mathematicae Graph Theory 2015
Marisa Gutierrez Benjamin Lévêque Silvia B. Tondato

A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید