✦ LIBER ✦

The complete resolution of Cartesian products of fuzzy sets

✍ Scribed by Mary M. Bourke; D. Grant Fisher

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 206 KB
Volume: 63
Category: Article
ISSN: 0165-0114
DOI: 10.1016/0165-0114(94)90151-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting stable sets on Cartesian produc

Counting stable sets on Cartesian products of graphs

✍ Florence Forbes; Bernard Ycart 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 552 KB

We study the generating functions for the number of stable sets of all cardinalities, in the case of graphs which are Cartesian products by paths, cycles, or trees. Explicit results are given for products by cliques. Algorithms based on matrix products are derived for grids, cylinders, toruses and h

Resolution of Eigen fuzzy sets equations

✍ Elie Sanchez 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 360 KB

On the Convergence of Fuzzy Sets and the

On the Convergence of Fuzzy Sets and the Completeness of the Space of Fuzzy Sets

✍ D. Zhang; H. Ouyang; E.S. Lee; R.R. Yager 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Critical groups for complete multipartit

Critical groups for complete multipartite graphs and Cartesian products of complete graphs

✍ Brian Jacobson; Andrew Niedermaier; Victor Reiner 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

## Abstract The critical group of a connected graph is a finite abelian group, whose order is the number of spanning trees in the graph, and which is closely related to the graph Laplacian. Its group structure has been determined for relatively few classes of graphs, e.g., complete graphs and compl

Characterization of the cartesian produc

Characterization of the cartesian product of complete graphs by convex subgraphs

✍ Yoshimi Egawa 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 115 KB

We show that if G is a connected graph with the same proper convex subgraphs as (Kn)', the Cartesian product of r copies of Kn, r >t 2, n >t 3, then [V(G)I ~> n" with equality if and only if G is isomorphic to (Kn)'. In this note we consider only connected finite undirected simple graphs. The compl

Equality and Coequality Relations on the

Equality and Coequality Relations on the Cartesian Product of Sets

✍ Daniel A. Romano 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB

EQUALITY AND COEQUALITY RELATIONS ON THE CARTESIAN PRODUCT O F SETS by DANEL A . ROMANO in Bihac (Yugoslavia) ## 0. Introduction The foundations on constructive mathematics, in BISHOP'S sense [l], rest on and comprise the three primitive notions of numbers, classes and computations. We believe tha