1. Introduction
Fixed-point theory (), which serves as a bridge between topology and analysis, is a fundamental and commonly used tool in modern mathematics. It investigates the circumstances in which a self-map on a non-empty set admits one or more fixed points. is divided into three categories: metric , topological , and discrete . This field’s researchers operate in a variety of directions and generalize their findings. Poincare and Brouwer made substantial contributions to this field, particularly Brouwer’s (topological) fixed-point theorem. The metric fixed-point theorem rose to popularity due to its applications in both pure and applied mathematics, particularly in determining the presence of solutions to nonlinear systems. Banach’s contraction principle, established in 1922, is a noteworthy achievement in and approximation theory, and it is well respected for its adaptability.
In
, the concept of metric space (
) and the Banach contraction principle (
) are fundamental. Many scholars have been drawn to metric spaces (
) because of their axiomatic clarity. Several writers have generalized the
by using various forms of contraction mappings in different
(for example, [
1,
2]). Mutlu and Gürdal [
3] introduced the concept of bipolar
in 2016, which is a type of partial distance that connects
and bipolar
. After that, Mutlu and Ozkan generalized coupled fixed-point theorems in bipolar
in 2017 [
4]. Furthermore, Gürdal et al. extended fixed-point results to multivalued mappings in these spaces in 2020 [
5]. Researchers interested in an in-depth analysis may refer to [
6,
7].
Many researchers are concentrating on the field of graphical
, as evidenced by pioneering articles such as [
8,
9,
10,
11]. Graph theory has become increasingly significant in the study of
. For solving DEs with infinite delay, Hammad and Zayed [
12] used fixed-point analysis on
b-
in conjunction with graph symmetry, while Shukla et al. defined graphical
[
13], and Chuensupantharat et al. [
8] defined graphical
b-
with accompanying graphs. In 2019, Younis et al. expanded on previous work by extending these notions to graphical rectangular
b-
and controlled-graphical
[
11,
14]. Hooda et al. [
15] provided a good summary of the literature on
b-
and their generalized forms. The authors emphasized specific ordered vector spaces derived from the
b-
and discussed their relevance in economic research. Then, using a graph endowed with edge symmetry, they built shared fixed-point outcomes on the vector
b-
. Popescu [
16], on the other hand, used the graphic contraction principle to deal with a new type of operator and produced fixed-point theorems that complement prior discoveries in nonlinear operator theory. A connection is shown between iterative techniques and Ulam–Hyers stability issues in particular. The illuminating article given in [
17] provides a comprehensive explanation of graphical structures.
Considering the aforementioned discussion, in this article, we establish the notion of graphical structure in bipolar
b-
, which is a generalization of bipolar
, prompted by the existing literature and following the work of Younis et al. and Mutlu and Gürdal [
3,
11]. We demonstrate the correctness of fixed-point theorems by using covariant and contravariant mapping contractions, respectively, and give examples with different cases.
2. Preliminaries
In this part of the article, we will discuss some primary definitions and certain primary facts necessary for the continued examination of the subject.
Consider , a digraph having no parallel edges carrying as a diagonal of , It is assumed that the vertex set (node-set) coincides with the set Ł, whereas is equipped with all the loops of the graph.
We refer to the graph with symmetric edges as
(graph symmetry). With this concept, we have
where
is a symmetric graph obtained by inverting the edges of
Let us say that the nodes of the digraph
are
and
w. A sequence
with
nodes is a path in
if the following contends:
If a path connects a node of to every other node, we say is connected. In the case of a graph, is undirected and possesses a path between its very pair of nodes; we call to be a weakly connected graph. A graph is considered to be a sub-graph of if and .
On the other side, a novel development in graph-metric theory was introduced by Shukla [
13], where the authors used the following notions:
consists of the set of all nodes Ł making a directed path from in with length l.
The symbol P represents a relation on Ł with representing that there is a path from to w in the graph .
If , then w is somewhere on the path .
Additionally, we say a sequence is term-wise-connected () if for all . Unless otherwise specified, all graphs will thereafter be interpreted as being directed.
Bipolar
are a new kind of partial distance introduced by Mutlu and Gürdal [
3]. In particular, they focus on the completeness of
and their connection to bipolar
. The following is the formal definition.
Definition 1 ([
3]).
A bipolar is triple such that and is a function satisfying the underlying properties:- 1.
If then
- 2.
If then
- 3.
for all
- 4.
for all , and is set of all non-negative real numbers. Then, d is called a bipolar on the pair
The following characteristics are listed following the aforementioned definition:
- (i)
If conditions (2) and (3) are satisfied, d is referred to as a bipolar pseudo-semi metric on the pair .
- (ii)
A bipolar pseudo-metric () is one where d is a bipolar pseudo-semi metric meeting (4).
- (iii)
A bipolar metric is a d satisfying (2).
A triple , where d is a bipolar (pseudo-(semi)) metric on , is referred to as a bipolar (pseudo-(semi)) . Specifically, the space is referred to as a disjoint if ; otherwise, it is referred to as a joint. The left and right poles of are the sets L and , respectively.
A typically only considers the distance between points that are in different poles of space. It also reveals some details about these poles’ internal structure.
Example 1 ([
3]).
The following are some examples related to the defined terms:- (i)
If is a (pseudo-(semi)) with distance function d, then is a bipolar (pseudo-(semi)) . Conversely, if is a bipolar (pseudo-(semi)) with , then is also a (pseudo-(semi)) .
- (ii)
In a quasi- , if we define the set , then is a disjoint bipolar , where for every . The axiom of regularity requires that the sets Ł and be disjoint.
- (iii)
Let Ł be a set, and d be a pseudo-semimetric on Ł with the property that . The point-to-set distance function is a bipolar pseudo-semimetric on the pair .
- (iv)
Consider the nonempty sets Ł and , a pseudo- , and a function . The function defined as represents a on . If Ł and are normed spaces, then denotes a on .
- (v)
Let C represent the set of all functions, , and can be defined as . The space is a disjoint bipolar .
Definition 2 ([
4]).
Let and be two sets and consider a mapping ; then, T is called a covariant () if T fulfills the underlying property:On the other hand, T is called a contravariant mapping () if the following condition is met: Such types of mappings are denoted by . One should take care that and are bipolar on and , respectively.
Definition 3 ([
5]).
Suppose is a bipolar . A point is the left point if the right point if and a central point if A sequence on Ł is the left sequence and on is the right sequence. A left or right sequence is simply a sequence in A sequence is said to be convergent to a point κ; if is the left sequence and κ is the right point, then Similarly, if is the right sequence and κ is the left point, then A sequence is said to be a bi-sequence on If both sequences and converge, then the is said to be bi-convergent, and if both sequences converge to the same point then is said to be bi-convergent. Every bi-convergent in is a Cauchy , and every convergent is bi-convergent. Definition 4 ([
3]).
Let and be a bipolar . A mapping T is continuous if it is left continuous at each point and right continuous at each point . A is continuous if and only if it is continuous as a .It can be seen from Definition 3 that a covariant or a is continuous if and only if on , implying that on .
3. Graphical Bipolar b-
In this section, we introduce the notion of graphical bipolar b- as follows:
Definition 5. Consider a metric endowed with the graph Θ with Ł and , contending the following axioms:
- 1.
If then
- 2.
If then
- 3.
for all
- 4.
,
for all and , where
A triplet is called a graphical bipolar b- if satisfies the postulates (1–4).
Remark 1. It is noteworthy that graphical bipolar b- is the generalization of bipolar if we take .
Example 2. Let , , and the function is defined aswhere for all , and equipped with graph The graph , having the set of verticesand the set of edges given by the following:
The corresponding edges of the graph Θ are propounded in Figure 1. In order to verify that is graphical bipolar b-, we discuss some cases for validating the underlying inequality of Definition 5. Case (i): If we take and , we have Consequently, for , (1) holds. Case (ii): If and then This amounts to saying that (1) holds for . Case (iii): When and we find Evidently, (1) is valid for . For different cases, we adopt the same analysis to infer that is a graphical bipolar b- with .
Figure 1.
Underlying graph.
Figure 1.
Underlying graph.
Definition 6. Let be a function on pairs of sets and . If and f is known as from to and denoted as If and f is known as from to and denoted as If and are graphical bipolar on and , respectively, then, we use the notionsand Definition 7. Let be a graphical bipolar b-:
- (i)
A point is the left point if , the right point if , and a central point if
- (ii)
A sequence on Ł is the left sequence and on is the right sequence. A left or right sequence is simply a sequence in A sequence is said to be convergent to a point z if is the left sequence and z is a right point; then, Similarly, if is the right sequence and z is a left point then - (iii)
A sequence is said to be on If both sequences and converge, then the is said to be bi-convergent, and if both sequences converge to the same point then is said to be bi-convergent.
- (iv)
Every bi-convergent in is a Cauchy and every convergent is bi-convergent.
- (v)
A graphical bipolar b- is called complete if every Cauchy in is convergent.
Definition 8. Let and be the graphical bipolar b-:
- (i)
A mapping is said to be left continuous at a point if for every there exists such that Similarly, it is right continuous at a point if for every there exists such that and a mapping f is called continuous if it is left continuous at each point and right continuous at each point
- (ii)
A mapping is continuous if it is continuous as a covariant mapping
Now, we can say that a and are continuous from to if:
4. Main Results
In this section, we will give some fixed-point theorems for and , satisfying various contractive conditions in the environment of graphical complete bipolar b- We treated the graph as a weighted graph. Let and be the initial values of the ; we say is Picards if and for all
Definition 9. Consider a relation P on with if there exists a path from to in Θ. If , then a is termwise connected if for all , , and Furthermore, we say a graph satisfies the property if a Picards is bi-convergent in , which guarantees that there is a limit κ such that or for all
Definition 10. Let Θ be a graph containing all the loops associated with graphical bipolar b- A is said to be contraction (on on a graphical bipolar b- if
- (i)
For , the graph is preserved, - (ii)
There exists for all and with implies
Theorem 1. Let be a graphical contraction on a complete graphical bipolar metric If the underneath axioms are contended,
- (i)
The property is asserted by the graph Θ.
- (ii)
There exists and with for some
Then, there exists such that with the initial value and is and bi-converges to both and .
Proof. Let
and
such that
for some
By taking
and
as initial values of
there exists a path
such that
and
where
for
By using (
2), we have
for
This implies that
is a path from
to
having length
l such that
Continuing this procedure, we conclude that
is a path from
to
of length
l and hence
for all
This confirms that
is a
, which shows that
Continuing the same procedure, we conclude that
Since the
is a
, now, we have to show that
is Cauchy
in graphical bipolar
b-
for each positive integer
n and
m. We have
Now for
we assert
Furthermore, we can prove that
From the observation of (
4)–(
6), if we set
, then we have
which shows that
is a Cauchy
. Now,
being a
complete graphical bipolar
b-
,
is bi-convergent to
in
. Making use of
, there exists some
such that
and
for all
and
which confirms that
is bi-convergent to
If
, then by using (
3)
for all
which shows that
If
a similar argument to that we used above,
Hence, is bi-convergent to and □
To demonstrate that the mapping f has a fixed point, we define the property
Definition 11. Let be a mapping on graphical bipolar b- We say that if the quadruple meets the property corresponding to two limits and of a we have .
Theorem 2. If all the hypotheses in Theorem 1 are true and we further suppose that the quadruple meets the property then f concedes a fixed point.
Remark 2. It is worth noting that in the setting of graphical bipolar b- , Theorem 2 is an extended form of . To clarify, we can observe that inequality (3) is more general when evaluated within the context of graphical bipolar b- . This is backed further by Remark 1. With these facts, it can be readily seen that the remarkable results attributed to Banach and Mutlu and Gürdal [3] are special cases of the Theorem 2. Proof. Theorem 1 exhibits that with initial values and bi-converges to both and Since and by hypothesis, we obtain and f concedes a fixed point. □
Below, we will discuss an example related to Theorem 1 with different cases.
Example 3. Let , , and the function is defined asfor all , and equipped with graph The graph , having the set of verticesand the set of edges obtained from the vertex set , is obtained as See Figure 2 for further exposition. It is simple to confirm that is a graphical bipolar b- with . Now, we define a with and wherefor all and Furthermore, if and we have the following Again, if and we inferproving that f is a contraction with and where A simple computation leads us to obtain . This shows that all the assertions of the Theorem 1 are met, and f concedes a fixed point for all and which is Below, we will prove a similar result for .
Definition 12. Let Θ be a graph containing all the loops associated with graphical bipolar b- A is said to be a contraction (on on a graphical bipolar b- if the following axioms are upheld:
- (i)
For , we have - (ii)
There exists for all and with implies
Theorem 3. Let be a graphical contraction on a complete graphical bipolar b- if the following conditions hold:
- (i)
Θ exhibits the property .
- (ii)
There exists and with for some
Then, there exists such that with the initial value is and bi-converges to both and .
Proof. Let
such that
for some
By taking
as the initial values of
there exists a path
such that
and
where
for
By using (
7), we assert that
for
This implies that
is a path from
to
having length
l such that
Continuing this procedure, we conclude that
is a path from
to
of length
l and hence
for all
This confirms that
is a
, which shows that
Imposing inequality (
8), we infer
Continuing the same approach, we arrive at the conclusion that
Since the
is a
, it is imperative to prove that
is Cauchy
in graphical bipolar
b-
. For every positive integer
n and
m, we proceed as follows:
Now, for
we obtain
From the observations (
9)–(
11), if we set
, we arrive at
which shows that
is a Cauchy
. Since
is a
complete graphical bipolar
b-
, then
is bi-convergent to
in
and from
there exists some
such that
and
for all
and
which confirms that
is bi-convergent to
If
, then by using (
8)
for all
which shows that
If
a similar argument to that we used above,
Hence,
is bi-convergent to
and
□
To demonstrate that mapping f has a fixed point, we employ the attribute
Theorem 4. If all the hypotheses are retained in Theorem 3 and we further suppose that the quadruple fulfills the property then f concedes a fixed point.
Proof. From the Theorem 3, we find that with the initial values bi-converges to both and Since and by hypothesis, we obtain and f concedes a fixed point. □
Below, we will discuss an example related to Theorem 3 with different cases.
Example 4. Let , and be defined asfor all and For , it is simple to observe that is graphical bipolar with the vertex set and edge set , as shown in Figure 3. We define a using the following:with , such thatandfor all , The cases below are examined while assuming that :
Case (i): When and , then Evidently, the case holds for and .
Case (ii): For and , Hence, contraction is satisfied for and where After simple calculation, we obtain . This suggests that all the requirements of Theorem 3 are satisfied, and f concedes a fixed point for all and which is
Similarly, we can continue Example 3 related to Theorem 1 with .
Example 5. If we take all the terms and conditions of Example 3 and define a with and such thatfor all and For and thenwhich is true for and . Hence, contraction is satisfied for and where With routine calculations, we obtain showing that all the requirements of Theorem 3 are met, and f concedes a fixed point for all and which is
Remark 3. It is important to note that all of the conclusions presented in this article apply equally to symmetric graphs, or graphs in which edge symmetry exists.
5. Conclusions
Metric spaces and their various generalizations allow us to consider the distances between points in a set, either classically or non-classically. However, in some situations, distances might occur between components of two distinct sets compared to between points of a single set. Distances among the same type of points are either indefinite or unclear in some circumstances due to a lack of data. Illustrations of these distances abound in mathematics and science. Some examples include distance within lines and points in a Euclidean space, suitability measurement of habitats to species, an affinity across a group of students, and a set of duties, etc. We formalize such distances as the graphical bipolar b-metric but only examine them isometrically without deeply delving into their topological aspects. We begin by offering basic definitions and examples of graphical bipolar b-, then explain maps and bi-sequences, investigate the completeness, explore some related features, and conclude with convergence results, employing covariant and contravariant mapping contractions in the form of graphs.
With this aim, we instigate a novel notion, termed graphical bipolar b-metric spaces, which combines graphical analysis and fixed-point theory. We propound fixed-point results using covariant and contravariant mapping contractions within the context of graphical bipolar b-metric spaces, a novel study within the field of graphical metric spaces, considering the symmetry of the edges of the underlying graph. These results are the first of their kind in the current state of the art. Illustrative examples with appropriate graphs are provided to demonstrate the findings. These examples help to improve the comprehension and implementation of the concepts that have been developed.
We offer the following open questions for future developments of this study:
- ▸
Can the proposed convergence theorems in this study be generalized to multi-valued mappings?
- ▸
Is it possible to use and to obtain the fixed points for Reich-type contractions in a graph setting?