Convex Sets Under Some Graph Operations
β Scribed by Sergio R. Canoy, Jr.; I.J.L. Garces
- Publisher
- Springer Japan
- Year
- 2002
- Tongue
- English
- Weight
- 99 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In [5, 61 a criterion for the undecidability of second order theories of classes of graphs is introduced. This criterion leads to a "measure of complexity" of a class of graphs. In this note we introduce some graph theoretical operations and prove that the class of all graphs which have the smallest
We deΓΏne concentration, dilation and normalization of intuitionistic fuzzy sets. These deΓΏnitions will be useful while dealing with various linguistic hedges like "very", "more or less", "highly", "very very" etc. involved in the problems under intuitionistic fuzzy environment. We also prove some pr