Atnaujinkite slapukų nuostatas

Fuzzy Graphs and Fuzzy Hypergraphs 2000 ed. [Kietas viršelis]

  • Formatas: Hardback, 250 pages, aukštis x plotis: 235x155 mm, weight: 1220 g, XIII, 250 p., 1 Hardback
  • Serija: Studies in Fuzziness and Soft Computing 46
  • Išleidimo metai: 26-Apr-2000
  • Leidėjas: Physica-Verlag GmbH & Co
  • ISBN-10: 3790812862
  • ISBN-13: 9783790812862
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 250 pages, aukštis x plotis: 235x155 mm, weight: 1220 g, XIII, 250 p., 1 Hardback
  • Serija: Studies in Fuzziness and Soft Computing 46
  • Išleidimo metai: 26-Apr-2000
  • Leidėjas: Physica-Verlag GmbH & Co
  • ISBN-10: 3790812862
  • ISBN-13: 9783790812862
Kitos knygos pagal šią temą:
In the course of fuzzy technological development, fuzzy graph theory was identified quite early on for its importance in making things work. Two very important and useful concepts are those of granularity and of nonlinear ap­ proximations. The concept of granularity has evolved as a cornerstone of Lotfi A.Zadeh's theory of perception, while the concept of nonlinear approx­ imation is the driving force behind the success of the consumer electronics products manufacturing. It is fair to say fuzzy graph theory paved the way for engineers to build many rule-based expert systems. In the open literature, there are many papers written on the subject of fuzzy graph theory. However, there are relatively books available on the very same topic. Professors' Mordeson and Nair have made a real contribution in putting together a very com­ prehensive book on fuzzy graphs and fuzzy hypergraphs. In particular, the discussion on hypergraphs certainly is an innovative idea. For an experienced engineer who has spent a great deal of time in the lab­ oratory, it is usually a good idea to revisit the theory. Professors Mordeson and Nair have created such a volume which enables engineers and design­ ers to benefit from referencing in one place. In addition, this volume is a testament to the numerous contributions Professor John N. Mordeson and his associates have made to the mathematical studies in so many different topics of fuzzy mathematics.
Foreword v
Preface vii
Acknowledgments ix
Fuzzy Subsets
1(18)
Fuzzy Relations
4(2)
Fuzzy Equivalence Relations
6(3)
Pattern Classification
9(2)
Similarity Relations
11(5)
References
16(3)
Fuzzy Graphs
19(64)
Paths and Connectedness
20(20)
Bridges and Cut Vertices
21(1)
Forests and Trees
22(3)
Trees and Cycles
25(1)
A Characterization of Fuzzy Trees
26(5)
(Fuzzy) Cut Sets
31(2)
(Fuzzy) Chords, (Fuzzy) Cotrees, and (Fuzzy) Twigs
33(2)
(Fuzzy) 1-Chain with Boundary 0, Coboundary, and Cocyles
35(1)
(Fuzzy) Cycle Set and (Fuzzy) Cocycle Set
36(4)
Fuzzy Line Graphs
40(5)
Fuzzy Interval Graphs
45(17)
Fuzzy Intersection Graphs
46(1)
Fuzzy Interval Graphs
47(2)
The Fulkerson and Gross Characterization
49(2)
The Gilmore and Hoffman Characterization
51(11)
Operations on Fuzzy Graphs
62(8)
Cartesian Product and Composition
62(4)
Union and Join
66(4)
On Fuzzy Tree Definition
70(8)
References
78(5)
Applications of Fuzzy Graphs
83(52)
Clusters
86(1)
Cluster Analysis
87(10)
Cohesiveness
92(1)
Slicing in Fuzzy Graphs
93(4)
Application to Cluster Analysis
97(5)
Fuzzy Intersection Equations
102(6)
Existence of Solutions
102(6)
Fuzzy Graphs in Database Theory
108(4)
Representation of Dependency Structure λ(X, Y)
111(1)
A Description of Strengthening and Weakening Members of a Group
112(8)
Connectedness Criteria
114(3)
Inclusive Connectedness Categories
117(1)
Exclusive Connectedness Categories
118(2)
An Application to the Problem Concerning Group Structure
120(9)
Connectedness of a Fuzzy Graph
121(2)
Weakening and Strengthening Points a Directed Graph
123(6)
References
129(6)
Fuzzy Hypergraphs
135(98)
Fuzzy Hypergraphs
135(6)
Fuzzy Transversals of Fuzzy Hypergraphs
141(29)
Properties of Tr (H)
153(5)
Construction of Hs
158(12)
Coloring of Fuzzy Hypergraphs
170(29)
β-degree Coloring Procedures
179(15)
Chromatic Values of Fuzzy Colorings
194(5)
Intersecting Fuzzy Hypergraphs
199(18)
Characterization of Strongly Intersecting Hypergraphs
205(2)
Simply Ordered Intersecting Hypergraphs
207(5)
H-dominant Transversals
212(5)
Hebbian Structures
217(4)
Additional Applications
221(8)
References
229(4)
List of Figures 233(2)
List of Tables 235(2)
List of Symbols 237(6)
Index 243