Source-linked AI summary
Interval-valued fuzzy graphs
Muhammad Akram, Wieslaw A. Dudek
TL;DR
The paper develops operations and structural notions for interval-valued fuzzy graphs, extending graph analysis to interval-valued membership information. It establishes properties of these constructions, including that joins preserve the interval-valued fuzzy graph structure, and identifies applications as future work.
Problem
The paper addresses how graph operations and structural concepts can be defined and studied for interval-valued fuzzy graphs.
Method
The authors define Cartesian product, composition, union, and join for interval-valued fuzzy graphs and introduce interval-valued fuzzy complete graphs and related isomorphism concepts.
Results
The paper investigates properties of the defined operations and interval-valued fuzzy complete graphs, including self-complementary and self-weak-complementary cases.
Takeaways & Limitations
Interval-valued fuzzy graphs are presented as a framework offering more precision, flexibility, and compatibility than classical and fuzzy models.
Takeaways & Limitations
Applications of interval-valued fuzzy graphs in database theory and expert systems are identified as projects for further study.
Abstract
from arXiv · showhide
We define the Cartesian product, composition, union and join on interval-valued fuzzy graphs and investigate some of their properties. We also introduce the notion of interval-valued fuzzy complete graphs and present some properties of self complementary and self weak complementary interval-valued fuzzy complete graphs.
1 Introduction
The introduction motivates interval-valued fuzzy sets as a more adequate representation of uncertainty and situates interval-valued fuzzy graphs within established fuzzy-set and fuzzy-graph theory.
- Interval-valued fuzzy sets extend fuzzy sets by representing membership degrees as numerical intervals rather than single numbers.
- They provide a more adequate description of uncertainty than traditional fuzzy sets and have applications including fuzzy control.
- The introduction connects this framework to prior work on approximate reasoning, medical diagnosis, multivalued logic, and intelligent control.
- Fuzzy graph theory generalizes Euler’s graph theory by modeling fuzzy relations between fuzzy sets and adapting graph-theoretical concepts.
2 Preliminaries
The preliminaries define graph-theoretic, fuzzy-set, interval-number, and isomorphism concepts used to formulate operations on interval-valued fuzzy graphs.
- A graph is an ordered pair G∗ = (V, E), while a complete graph connects every pair of distinct vertices and has n(n − 1)/2 edges.
- The Cartesian product uses vertex set V1 × V2 and combines edges induced by adjacency in either factor graph.
- Graph composition is generally noncommutative, since G∗1[G∗2] ≠ G∗2[G∗1].
- Graph union combines vertex and edge sets, whereas the join additionally adds all edges between the two vertex sets and assumes they are disjoint.
- An interval-valued fuzzy graph pairs interval-valued fuzzy vertex and edge information constrained by an interval-valued fuzzy relation.
3 Operations on interval-valued fuzzy graphs
The paper defines four operations on interval-valued fuzzy graphs—Cartesian product, composition, union, and join—and establishes when these constructions remain interval-valued fuzzy graphs.
- An interval-valued fuzzy graph consists of interval-valued fuzzy vertex and edge sets associated with a crisp graph.
- Cartesian product: The Cartesian product combines two interval-valued fuzzy graphs through vertex and edge operations, and yields an interval-valued fuzzy graph of the crisp Cartesian product.
- Composition: Composition is defined using A1 ◦ A2 and B1 ◦ B2, and the resulting graph is an interval-valued fuzzy graph of the crisp composition.
- Union: The union of two interval-valued fuzzy graphs is formed componentwise and is itself an interval-valued fuzzy graph.
- Join: The join is defined componentwise while adding all edges between the two vertex sets, and it preserves the interval-valued fuzzy graph structure.
- Union and join properties: For disjoint underlying crisp graphs, the union is an interval-valued fuzzy graph if and only if both component graphs are interval-valued fuzzy graphs.
4 Isomorphisms of interval-valued fuzzy graphs
This section defines homomorphisms and weak variants for interval-valued fuzzy graphs, characterizes their isomorphisms, and illustrates that weak relations need not be full isomorphisms.
- The section characterizes various types of weak isomorphisms and co-isomorphisms of interval-valued fuzzy graphs.
- A homomorphism is a mapping between interval-valued fuzzy graphs satisfying the stated membership-preservation condition.
- A weak isomorphism is a bijective homomorphism that preserves node weights but not necessarily arc weights.
- A weak co-isomorphism is a bijective homomorphism that preserves arc weights but not necessarily node weights.
- An isomorphism is a bijective mapping satisfying both the node- and arc-related preservation conditions.
- The examples show maps that are weak isomorphisms or weak co-isomorphisms but not isomorphisms, while isomorphism itself is an equivalence relation.
5 Interval-valued fuzzy complete graphs
This section introduces interval-valued fuzzy complete graphs and studies their complements, self-complementarity, closure under composition, and isomorphism conditions.
- An interval-valued fuzzy graph is complete when it satisfies the section’s stated completeness condition.
- A three-vertex cycle equipped with specified interval-valued fuzzy subsets provides an example of an interval-valued fuzzy complete graph.
- Composition preserves completeness: if G is an interval-valued fuzzy complete graph, then G[G] is also complete.
- The complement and self-complementary notions are defined for interval-valued fuzzy complete graphs.
- For a self-complementary interval-valued fuzzy complete graph, an automorphism yields the membership identities stated in Proposition 5.7.
- A stated membership condition on an interval-valued fuzzy complete graph is sufficient for self-complementarity.
- Two interval-valued fuzzy complete graphs are isomorphic exactly when the membership conditions stated in Proposition 5.9 hold.
6 Conclusions
The paper introduces interval-valued fuzzy graphs and presents several of their properties, while identifying application areas for future study.
- 6 Conclusions: Interval-valued fuzzy graphs are introduced, and the paper presents several properties of these graphs.The authors place this work within interval-valued fuzzy models, which they describe as more precise, flexible, and compatible than classical and fuzzy models.
- 6 Conclusions: Applications of interval-valued fuzzy graphs in database theory are proposed as a future research direction.
- 6 Conclusions: Applications of interval-valued fuzzy graphs in expert systems are proposed as a future research direction.
- 6 Conclusions: Applications of interval-valued fuzzy graphs in neural networks are proposed as a future research direction.
- 6 Conclusions: An interval-valued fuzzy graph method for finding shortest paths in networks is proposed for future study.