Mordeson / Nair | Fuzzy Graphs and Fuzzy Hypergraphs | E-Book | www.sack.de
E-Book

E-Book, Englisch, Band 46, 250 Seiten, eBook

Reihe: Studies in Fuzziness and Soft Computing

Mordeson / Nair Fuzzy Graphs and Fuzzy Hypergraphs


2000
ISBN: 978-3-7908-1854-3
Verlag: Physica
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 46, 250 Seiten, eBook

Reihe: Studies in Fuzziness and Soft Computing

ISBN: 978-3-7908-1854-3
Verlag: Physica
Format: PDF
Kopierschutz: 1 - PDF Watermark



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.

Mordeson / Nair Fuzzy Graphs and Fuzzy Hypergraphs jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Fuzzy Subsets: Fuzzy Relations.- Fuzzy Equivalence Relations.- Pattern Classification.- Similarity Relations.- References.- Fuzzy Graphs: Paths and Connectedness. Bridges and Cut Vertices. Forests and Trees. Trees and Cycles. A Characterization of Fuzzy Trees. (Fuzzy) Cut Sets. (Fuzzy Chords, (Fuzzy) Cotrees, and (Fuzzy) Twigs. (Fuzzy) 1-Chain with Boundary 0, (Fuzzy) Coboundary, and (Fuzzy) Cocycles. (Fuzzy) Cycle Set and (Fuzzy) Cocycle Set.- Fuzzy Line Graphs.- Fuzzy Interval Graphs. Fuzzy Intersection Graphs. Fuzzy Interval Graphs. The Fulkerson and Gross Characterization. The Gilmore and Hoffman Characterization.- Operations on Fuzzy Graphs: Cartesian Product and Composition. Union and Join.- On Fuzzy Tree Definition.- References.- Applications of Fuzzy Graphs: Clusters.- Cluster Analysis. Cohesiveness. Slicing in Fuzzy Graphs.- Application to Cluster Analysis.- Fuzzy Intersection Equations. Existence of Solutions.- Fuzzy Graphs in Database Theory. Representation of Dependency Structure r(X,Y) by Fuzzy Graphs.- A Description of Strengthening and Weakening Members of a Group. Connectedness Criteria. Inclusive Connectedness Categories. Exclusive Connectedness Categories.- An Application of Fuzzy Graphs to the Problem Concerning Group Structure. Connectedness of a Fuzzy Graph. Weakening and Strenghtening Points of a Fuzzy Directed Graph.- References.- Fuzzy Hypergraphs: Fuzzy Hypergraphs.- Fuzzy Transversals of Fuzzy Hypergraphs. Properties of Tr(H). Construction of H3.- Coloring of Fuzzy Hypergraphs. beta-degree Coloring Procedures. Chromatic Values of Fuzzy Colorings.- Intersecting Fuzzy Hypergraphs. Characterization of Strongly Intersecting Hypergraphs. Simply Ordered Intersecting Hypergraphs. H-dominant Transversals.- Hebbian Structures.- Additional Applications.- References.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.