1. Introduction
The subject of graph theory is gaining popularity due to its applications. It is in the mainstream of mathematics and applied sciences, where it plays an important role. A
graph is consisting upon an ordered pair, where is the set of all vertices of a graph and represents the relation among the vertices of the graph , named as a set of edges. Further,
represents the cardinality of vertex set
V (known as order of graph
), and
represents the cardinality of edge set
of graph
. Main graph theory has two classes; one class deals with the undirected graphs if there is no direction or restriction for moving one vertex to the other if both vertices are connected, and other class deals with the directed graphs in which every edge has a particular direction. Edges in a directed graph are ordered pairs, while edges in an undirected graph are unordered pairs. Leonhard Eular (1736) solved the classic unsolved problem known as the Konigsberg Bridge Problem; he was named the “Father of Graph Theory.” Due to the graphical nature of this theory, there are several applications, including data flow diagrams, decision-making abilities, the capacity to demonstrate relationships between things, and the ability to easily adapt and modify the existing systems. Graph theory has a wide range of applications in chemical sciences [
1,
2], data science [
3], and architecture [
4].
On the other hand, Jachymski [
5] used the graphical structure in fixed-point theory and proved several fixed-point results via graphical structure. Shukla et al. [
6] used graphical structure in metric spaces and generalized several fixed-point results in graphical metric space with an application to integral equations. Chen et al. [
7] introduced a graphical convex metric space and fixed-point results for set valued G-contraction mappings with application.
In 1965, fuzzy set theory initiated by L. A. Zadeh [
8] introduced a method to deal with uncertainty and vagueness in our daily life. Kramosil and Michalek [
9] used the notions of fuzzy sets with metric spaces established the notion of fuzzy metric spaces (FMSs) via continuous t-norms (CTNs), in which the notion of probabilistic metric spaces is generalized. George and Veeramani ([
10,
11]) modified the concept of FMSs and obtained a Hausdorff topology for this kind of FMSs. Moreover, the theory of fixed points on FMS was developed in many directions, generalizing the fuzzy metric space or using different type of operators [
12,
13,
14,
15,
16,
17,
18,
19].
In this manuscript, the authors will generalize the notion of FMSs. The main objectives of this manuscript are following:
- (a)
to establish a novel notion of graphical FMSs;
- (b)
to make a comparison between ordered FMS and graphical FMS;
- (c)
to generalize several contraction mappings and fixed point results;
- (d)
to find the existence of solution of integral equation via fixed-point theory;
- (e)
to find the existence of a solution of fractional differential equations via fixed-point theory.
Some Basics from Graph Theory
In this section, the authors discuss some basic definitions from graph theory that are useful for readers to understand this work. For more details, the authors refer to the papers of Jachymski [
5] and Shukla et al. [
6].
Consider a non-empty set
and assume
to be the cartesian product; the authors denote the diagonal of
by
Suppose
to be a direct graph in which the edges are not parallel, such that the set of its vertices
coincides with
, and all loops are contained in the set of its edges
; then, call that
is endowed with graph
. Here
denote the graph’s
conversion and defined by:
The undirected graph examined from
is denoted by
that contains all the edges of
The authors thus write:
Suppose are the vertices of a graph ; then the path having length from in is a sequence of vertices such that If there exists a path between any two vertices, then the authors say that is connected. If there exists a path from between two vertices in a directed graph, then the authors say that vertices are connected. If every one of its edges are dealt as being undirected and there is a path between every two vertices, then the authors say that is weakly connected. Alternatively, if is connected, then is weakly connected.
The authors define a relation
on
by
if and only if there is a direct path from
The authors say
if
is included in a direct path from
. For
the authors define:
A sequence is known as connected if it satisfies for all . A connected component of an undirected graph is a sub-graph that has any two vertices connected to each other by pathways and is not connected to anymore vertices in the super-graph.
In this paper, the authors allot a fuzzy weight to a degree of nearness between at , where is interpreted as a time. The authors assume that the graphs under study are directed with non-empty sets of vertices and edges throughout this paper.
2. New Notions with Examples
In this section, several novel notions are defined with some non-trivial examples.
Definition 1. Supposebe a non-empty set endowed with a graph, is a continuous t-norm, andis a fuzzy set on; the mappingis known as a graphical fuzzy metric (FM), if
- (a)
- (b)
if and only if
- (c)
- (d)
- (e)
is continuous,
for alland. Thenis known as a graphical FMS.
Example 1. Every FMS is a graphical FMS with a graphwhereandat a time
Definition 2. Letbe a partially ordered set,is a continuous t-norm, andis a fuzzy set onthe mappingis known as ordered fuzzy metric, if
- (i)
- (ii)
if and only if
- (iii)
- (iv)
- (v)
is continuous.
For all and . Then is known as ordered FMS.
Example 2. Let be an ordered FMS and be a graph defined by and at a time Then is a graphical FMS, where for all and Therefore, each ordered FMS is a graphical FMS with the given graph Where is an induced graph by the partial order .
Example 3. Let
define CTN by and partial order by . Define by: Then is an ordered FM and is an ordered FMS. Then the graphical FM is not a fuzzy metric. Indeed, for and , the authors obtain: On the other hand: The authors have Example 4. Suppose an undirected graphwithLetbe the components ofthat are connected such thatat a timeLetbe the length of the shortest fromto. Now definewithbyThen,is a graphical FM onandis a graphical FMS. Example 5. Supposeand the graphdescribed byandat a timeLetand describe a mappingbyThen,is a graphical FM onandis a graphical FMS. Indeed,is not an FM onLetandtherefore deducing that:As seen in the above examples, every FMS is a graphical FMS, but the converse is not true. Definition 3. Letbe a graphical FMS. An open ballwith center, radiusandis defined bySincethen the authors havefor allThe collection is known as the neighbourhood system for the topology and defined byoninduced by the graphical FMOpenly,is a subset ofthat is known as open for eachif there exists ansuch thatforIndeed, if complementis open of a subsetofthen it is known as closed. Lemma 1. Every open ball inis an open set.
Proof. Suppose an open ball
with center
, radius
and time
Assume
then
Since
, there exist
such that
. Put
As
there exists
such that
At this instant for specified
and
such that
, there exists
such that
Set
and let the open ball
. The authors claim that
. By definition, there is
and
such that
At this instant, suppose
Then
Therefore,
Therefore,
and
□
Next, in graphical FMS, the authors define the terms convergence, Cauchy sequence, and completeness.
Definition 4. Assumeto be a graphical FMS and a sequenceinThenis known as convergent and converges toif, for knownthere existssuch thatfor allIt is obvious that the sequenceis convergent and converges toif and only if
Remark 1. In a graphical FMS, the limit of a sequence may not be unique. In order to examine this, suppose, and letbe a graph withandat a timeLetand describe a mappingby:Then,is a graphical FM onandis a graphical FMS. Supposeto be a sequence inwherefor eachand then for any fixed we deduce:
Therefore, the sequence converges to for every fixed Remark 2. Supposeto be a graphical FMS in the above remark, andis a limit of the sequence, but for anythe authors have:That is, a graphical FM need not be continuous. Lemma 2. Supposeto be a graphical FMS with topologyinduced by graphical FM. Thenis abut notgenerally, i.e., Hausdorff.
Proof. The authors will demonstrate that for each , the set that is singleton is a closed subset of i.e., the set is open in Assume , then i.e., Now, let Then the authors observe that otherwise which is a contradiction. It shows that , and so is open. □
Definition 5. Let be a graphical FMS and a sequenceinThenis known as a Cauchy sequence if, specifiedthere existssuch thatfor all It is obvious that the sequenceis a Cauchy sequence if and only if
Definition 6. A graphical FMSis known as complete if each Cauchy sequence inconverges inSupposeis a different graph fromsuch thatifconnected the sequence inconverges in, thenis known as.
3. Fixed-Point Theorems
In this section, the authors discuss the existence of fixed-point theorems under some circumstances.
Definition 7. Supposeto be a graphical FMS, a mappingandto be a sub-graph ofsuch thatThen,is known asfuzzy graphical contraction (onif satisfying the following conditions:
- (FC1)
impliesat a timethat is, ϸ preserves edges in
- (FC2)
There existssuch that:
A sequence with initial valueis known as thePicard sequence iffor allIn order to continue the discussion, the authors suppose thatis a sub-graph ofsuch that Theorem 1. Suppose a complete graphical FMS , and let be a . Assume that the below circumstances fulfill:
- (A)
if there existsfor some
- (B)
If sequence, that is,termwise connectedPicard converges inthen forthere exist a limitandsuch thatorat a timefor all
Then, there exists such that a sequence is a Picard is termwise connected with initial value and converges to both and
Proof. Suppose
to be the extent that
for some and the
Picard sequence
starting from
. After that, there exists a path
such that
and
at a time for
Since
is a
, by (FC1),
at a time
for
Therefore,
is a path from
to
of length
and so
Continuing this process, we obtain that
is a path from
to
of length
l and so,
for all
Thus
is a
termwise connected sequence. Since
at a time
for
and
by (FC2), the authors obtain:
Since
is a sub-graph of
and a
termwise connected sequence that is
, for any
the authors achieve by utilizing (d) of Definition 1, and (1), whereinthe authors have:
Therefore, the sequence
is
termwise connected for
with
We examined that
Since
the authors obtain
Therefore,
is a Cauchy sequence in
Utilizing the fact that
have
completeness, the sequence
converges in
and utilizing circumstance (B), there exist
such that
or
at a time
for all
and
Therefore
converges to
At this instant, if
at a time
for all
applying (FC2), the authors deduce:
for all
. Since
the authors deduce
A similar result holds if
at a time
t for all
, and this gives us the sequence
that converges to
and
□
Remark 3. The above finding explains the convergence of a Picard sequence generated by aoncomplete graphical FMS. This theorem should not be regarded as an existence theorem, as seen in the below example in the context ofcomplete graphical FMS.
Example 6. Assumeand a graphwithandat a timeSupposeand describes a mappingby:Then,is a graphical FM onandis acomplete graphical FMS. Define a mappingby:Observe thatis anwhereandFor eachwe haveatthat is. Also, observe that all conditions of Theorem 1 and (B) hold, buthas no fixed point in Definition 8. Letbe a graphical FMS andbe a map. Then, the five-tupleis known to have property (2) if:
Whenever atermwise connectedPicard sequencetwo limitsand,
Theorem 2. Suppose acomplete graphical FMS, and letbe a. Assume that
- (A)
for there existfor some
- (B)
If sequence that istermwise connectedPicard converges inthen forthere exists a limitandsuch thatorat a timefor all
Then, there existssuch that a sequencethat isPicard istermwise connected with initial valueand converges to bothandFurthermore, if five-tuplecontains the property (2), then has a fixed point in
Proof. Applying Theorem 1, a sequence converges to and Since and consequently by applying (2) the authors must have . □
The authors symbolize the set of all fixed points of by and the perception that the authors utilize is
Theorem 3. Supposeto be acomplete graphical FMS, and letbe a. Assume that all conditions of Theorem 2 are satisfied; then,has a fixed point. Furthermore, ifis weakly connected (as a sub-graph of), then the fixed point ofis unique.
Proof. It is easy to observe that the existence of a fixed point follows from Theorem 2. Now, assume that
is weakly connected. Let
be two distinct fixed points of
Therefore,
includes all the loops, that is,
and so
The authors must get
or
because
is a weakly connected graph. Assume that
such that there exist a sequence
and
at a time
and for
Therefore
is a
fuzzy graphical contraction, and by consecutively utilizing (FC1), the authors deduce
at a time and for
and for all
Therefore, by (FC2) the authors have:
for
and for all
Now, by (d) of Definition 1, the authors get
Since
, the authors have
consequently, letting
as a result of the preceding inequality, the authors have
which implies that
Hence, the fixed point of
is unique. □
4. Applications
In this section, the authors utilize the fixed-point technique to find a solution of integral equations and nonlinear fractional differential equations.
First, the authors utilize a fixed-point technique to find a solution of integral equations on . The authors examine that the existence of a lower or upper solution to an integral equation implies the solution of the integral equation under certain conditions.
Let
be the set of all real valued continuous functions on
Let:
and describe the graph
by
and:
Now consider a graphical FM defined by
as:
Then
is a
complete graphical FMS with
. The authors suppose the integral equation as:
where
are continuous functions. The function
is known as a lower solution of Equation (3) if:
It is obvious that reverse inequality is met by an upper solution of
. Now, the authors examine the existence of a lower solution of
that reveals the existence of a solution of
The authors assume that
is an operator and is described by
which provides the necessary conditions for the existence of a fixed point of
in
Obviously, such a fixed point is a solution of the integral Equation
Theorem 4. Assume that the requirements listed below are met:
is increasing onfor eachFurthermore
such that forfor each, the authors have:
and
Then the existence of a lower solution of in demonstrates the existence of the solution of Proof. Observe that
is well defined. Also, by utilizing (ii), the authors get:
Further, for
the authors have
for all
and by utilizing (i), the authors deduce
and:
and
Therefore, the existence of a lower solution of
called
implies that Theorem 2′s condition (A) is fulfilled, which implies
. Also, observe that condition (B) of Theorem 2 satisfies the equation and a five-tuple
has the condition (2). All the circumstances of Theorem 2 are fulfilled and hence the operator
has a fixed point, which is a solution of the integral Equation
in
In the case of an upper solution of an integral Equation (3), one can construct using comparable reasoning; in this scenario, one can assume the below set:
continuing as above. Then, in order to avoid repetition, the authors leave out the details. □
Now the authors aim to apply Theorem 2 to obtain the existence of a solution to a nonlinear fractional differential equation:
with the boundary conditions:
where
is a fractional order,
is the Caputo fractional derivative, and
is a continuous function. Let
denote the space of all continuous functions defined on
equipped with the graph
described by
and
at a time
Let
for all
and define a graphical FMS as follows:
Observe that
solves (5) whenever
solves the following integral equation:
Theorem 5. The integral operatoris given bywherefulfilling the following criteria:Also, suppose that:Then nonlinear fractional differential equation has a unique solution in. Proof. where:
Therefore, the above equation:
for the variables
Observe that the conditions of the Theorem 2 are fulfilled. As a result,
has a fixed point; accordingly, the specified nonlinear fractional differential Equation (5) has a unique solution. □