Weighted and Fuzzy Graph Theory [electronic resource] / by Sunil Mathew, John N. Mordeson, M. Binu.

Por: Mathew, Sunil [author.]Colaborador(es): Mordeson, John N [author.] | Binu, M [author.] | SpringerLink (Online service)Tipo de material: TextoTextoSeries Studies in Fuzziness and Soft Computing ; 429Editor: Cham : Springer Nature Switzerland : Imprint: Springer, 2023Edición: 1st ed. 2023Descripción: XVII, 216 p. 92 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783031397561Tema(s): Computational intelligence | Graph theory | Computational Intelligence | Graph TheoryFormatos físicos adicionales: Printed edition:: Sin título; Printed edition:: Sin título; Printed edition:: Sin títuloClasificación CDD: 006.3 Clasificación LoC:Q342Recursos en línea: Libro electrónicoTexto
Contenidos:
Graphs and Weighted Graphs -- Connectivity -- More on Connectivity -- Cycle Connectivity -- Distance and Convexity -- Degree Sequences and Saturation -- Intervals and Gates -- Weighted Graphs and Fuzzy Graphs -- Fuzzy Results from Crisp Results.
En: Springer Nature eBookResumen: One of the most preeminent ways of applying mathematics in real-world scenario modeling involves graph theory. A graph can be undirected or directed depending on whether the pairwise relationships among objects are symmetric or not. Nevertheless, in many real-world situations, representing a set of complex relational objects as directed or undirected is not su¢ cient. Weighted graphs o§er a framework that helps to over come certain conceptual limitations. We show using the concept of an isomorphism that weighted graphs have a natural connection to fuzzy graphs. As we show in the book, this allows results to be carried back and forth between weighted graphs and fuzzy graphs. This idea is in keeping with the important paper by Klement and Mesiar that shows that many families of fuzzy sets are lattice isomorphic to each other. We also outline the important work of Head and Weinberger that show how results from ordinary mathematics can be carried over to fuzzy mathematics. We focus on the concepts connectivity, degree sequences and saturation, and intervals and gates in weighted graphs.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos 1 No para préstamo

Acceso multiusuario

Graphs and Weighted Graphs -- Connectivity -- More on Connectivity -- Cycle Connectivity -- Distance and Convexity -- Degree Sequences and Saturation -- Intervals and Gates -- Weighted Graphs and Fuzzy Graphs -- Fuzzy Results from Crisp Results.

One of the most preeminent ways of applying mathematics in real-world scenario modeling involves graph theory. A graph can be undirected or directed depending on whether the pairwise relationships among objects are symmetric or not. Nevertheless, in many real-world situations, representing a set of complex relational objects as directed or undirected is not su¢ cient. Weighted graphs o§er a framework that helps to over come certain conceptual limitations. We show using the concept of an isomorphism that weighted graphs have a natural connection to fuzzy graphs. As we show in the book, this allows results to be carried back and forth between weighted graphs and fuzzy graphs. This idea is in keeping with the important paper by Klement and Mesiar that shows that many families of fuzzy sets are lattice isomorphic to each other. We also outline the important work of Head and Weinberger that show how results from ordinary mathematics can be carried over to fuzzy mathematics. We focus on the concepts connectivity, degree sequences and saturation, and intervals and gates in weighted graphs.

UABC ; Perpetuidad

Con tecnología Koha