Enhancing automic and optimal control systems through graphical structures

The concept of graphical structures of extended suprametric space is introduced in this study and applied to supra-graphical contractive mapping. A recursive algorithm in connection with graphical notions can be employed in adaptive systems to construct a desired output function iteratively after specific conditions are first defined to ensure the existence of the solution by use of supra-graphical contractive mapping. After analyzing the historical context and relevant outcomes, we discuss the usage of graphical structures and supra-graphical contractive mappings in the conceptual frameworks of adaptive control and optimal control systems.


Enhancing automic and optimal control systems through graphical structures
The concept of graphical structures of extended suprametric space is introduced in this study and applied to supra-graphical contractive mapping.A recursive algorithm in connection with graphical notions can be employed in adaptive systems to construct a desired output function iteratively after specific conditions are first defined to ensure the existence of the solution by use of supra-graphical contractive mapping.After analyzing the historical context and relevant outcomes, we discuss the usage of graphical structures and supra-graphical contractive mappings in the conceptual frameworks of adaptive control and optimal control systems.
A graph is defined as a mathematical framework that connects a collection of points to express a specific function.A pair-wise connection among the objects is established using it.The edges that link the vertices (also known as nodes) of the graph are called vertices.Theoretically referred to as G = G (V , E) .Since graphs are essentially a method of encoding data, each characteristic of a graph corresponds to an actual component or notion in the information being represented.In order to fully appreciate graphs' articulation and universality as an embedding method, it is important to be familiar with how they can be utilized for illustrating complexities.
Figure 1 depicts the vertices and edges.A phenomenon according to the investigation has attributes, which are measurable characteristics.Attributes can be utilized to elaborate on both edges and vertices in the graph environment.We may have attributes for every individual (vertex) that quantify their current age, recognition, and online activity, to continue with our online community's instance.In a manner comparable to this, we could establish an attribute (edge) for every connection that measures the degree of familiarity between the two individuals or the nature of the connection (e.g., family-related, professional, etc.).Each of the vertices and edges may in fact have a variety of qualities to take into account, therefore they are denoted by numerical vectors of attributes with the v A i and e A i,j , correspondingly.Below stated Fig. 2 is a sample graph represents connections in the online community.
The method of maintaining or changing any value in an automated process or other piece of scientific machinery in accordance with predetermined circumstances without having the direct involvement of a human being is known as automatic control.Automatic controllers are devices that are assembled specifically for this use.The research and development of techniques for formulating regulations for managing systems that are able to be implemented by automated technologies.These techniques have traditionally been used primarily for technical procedures (see [1][2][3][4][5] ).As a result, an airplane in motion is a system whose control principles guarantee that it stays on the necessary trajectories.The automated pilot, which consists of transducers (measuring instruments) and actuators, is used to implement the rules and regulations.
The concept of optimal control is concerned with addressing the issue of determining the control principle for an instance of a system that meets a specific optimality condition.A cost function the fact that depends on stipulate and control parameters is a component of a control issue.A collection of mathematical models characterizing the movements of the parameters under control in a way that minimizes the cost function is referred to as an optimal control.Numerous optimum control problems have been studied using it extensively in the literature (see [6][7][8] ).In both the natural and applied sciences, the contractive mapping concept is one of the most effective methods for examining and/or solving existence results.The idea, which is additionally referred to as the fixed point problem, suggests that a recursive strategy provided by repeating representations under the mapping of any initial point in the metric space would always have a single fixed point that is able to be identified as the limit.The contractive mapping hypothesis is one that has been widely refined at every step of the course of history in many theoretical disciplines (see [9][10][11][12][13][14] ), and currently holds significance for complex scientific fields, computation algorithms, and numerical models.
The objective of this paper is to study the automatic flight path generation of a control function and optimum control in the context of graphical notions and nonlinear graphical supra-contractive mappings.

Primary details on graphical notions
Here, we provide a summary of a few fundamental concepts and practical findings that can be used as methods for further investigation.In addition, let M be a set that is not empty, and take △ be the diagonal generated by M × M .Assume that the directed graph G has zero parallel edges.The vertices of V (G ) has to correspond through M , and E(G ) ⊑ M × M is required to contain all loops.This makes (V (G ), E(G )) is used to identify G .The graph G −1 is referred to as a graph generated by switching to the reverse direction of its edges from G.
In other words: It is less restrictive when considering G and the collection of edges is symmetrical.With such a method, we produce the following: If a, b are vertices of G , and subsequently a path in G is a sequence a n i=0 of (n + 1) vertices in such a way that a 0 = a, a n = b and the pair (a i−1 , a i ) should be in E(G ) where i = 1, 2, 3, . . .n.In order for a graph G to be con- sidered to be connected-a minimum of one path must connect each pair of its vertices.If there exists a minimum of one directed path connecting each vertex to each subsequent one in a directed graph-it has been hypothesized  www.nature.com/scientificreports/ to be strongly connected.If the corresponding undirected graph of a directed graph G is connected nevertheless G fails to be strongly connected, the directed graph is said to be weakly connected.The set of all vertices and edges of A are subsets of G ; where A is a subgraph of graph G .If a vertex is present in A , it has a corresponding vertex in G , and any edge that connects two vertices in A will also connect the corresponding vertices in G .However, not all of the edges and not all of the vertices of G are required to exist in A.
In order to generalize the metric space by utilizing graphical notions, Shukla et al., 15 initially put forward the idea of graphical metric space: Definition 1 Suppose that M be a set that is nonempty and is endowed with the graph G .Let G m : M × M → R be a function gratifying the below mentioned assertions: wherea, b, c are any three elements of M.
The pair (M, G m ) is referred to as a graphical metric space, whereas the mapping G m is referred to as a graphical metric over M. Adopting various "triangular inequalities" with a provided set yields distinct graphical metric spaces: T h e r e e x i s t s a θ ∈ R + and for all a, b, c ∈ M such that (aPb 16 if we take (T 1 ) instead of (G 4 ) in Definition 1. (ii) Graphical suprametric if we take (T 2 ) instead of (G 4 ) in Definition 1. (iii) An extended graphical suprametric if we take (T 3 ) instead of (G 4 ) in Definition 1.
The pair (M, G ) is said to be a graphical b-metric/graphical suprametric/extended graphical suprametric space if G is a b-metric/graphical suprametric/extended graphical suprametric on M.
As a unification of graphical metric space 15 , suprametric space 17 and an extended suprametric space 18 , we first introduce the topics of graphical suprametric space and an extended graphical suprametric space as above.
Considering a relation P stated that over M, (aPb) G and [a] ℓ G are able to be characterized as follows: 1. (aPb) G ⇔ there exist a path in the direction from a to b in G and c ∈ (aPb) G if c is having a path in the direction from a to b in G; 2.
[a] ℓ G = {b ∈ M : there exists a directed path from a to b of length ℓ } , for more info, refer 16 .
Moreover, a sequence {a n } ∈ M is called G-termwise connected whenever (a n Pa n+1 )G where n should be in N.
Remark 2 An extended suprametric space (M, G ) is an extended graphical suprametric space having graph G , whenever It is worth noticing that we introduced an extended graphical suprametric space as a generalization of an extended suprametric space 18 .

E x a m p l e 3
Ta k e M = {0, 1, 2, 3} .D e f i n e t h e f u n c t i o n G m : Analyze the graph G with M = V (G ) as the collection of vertices and the edge set provided below: then (M, G ) is an extended graphical suprametric space with ϑ(a, b) = e a+b , confining the graph G as explained in below Fig. 3.

Remark 4
It is important to mention that graphical suprametric space can be an extended graphical suprametric space by taking ϑ(a, b) = θ (where θ ≥ 1 ) a constant function (where the mapping ϑ should map to a value greater than or equal to 1).But the converse may not be true.The following example supports our argument.as Using renowned literature [19][20][21][22] and the work done in this article, we develop subsequent Fig. 5 to better understand the graphical framework of suprametric and/or extended-suprametric spaces.Moreover, in below Fig. 5, inclusion is represented by an arrow.But however, reverse inclusion is not true.
We define open and closed balls as follows in order to investigate the topological structure of an extended graphical suprametric space.Proposition 8 Suppose (M, G m ) be an extended graphical suprametric space.Take a ∈ M and . Therefore, in accordance with the stated hypothesis, we have (aPb) G and (bPc) G and so (aPc) G .Consequently, the triangle inequality Proposition 9 Let (M, G m ) be an extended graphical suprametric space.Let τ be the family of all open subsets of M .Then τ is a topology on M. Definition 10 Let (M, G m ) be an extended graphical suprametric space.1.A sequence {a n } converges to some a in M .If for all positive ε , there is some positive Example 11 Let a n = 1 2 n for n ∈ N be a sequence in an extended graphical suprametric space (M, G m ).
converges to "0" in an extended graphical suprametric space (M, G m ).

Graphical supra-contractive mappings
As a generalization of the idea of graphical contraction in distance spaces, we introduce a subsequent definition at the outset of this section.

Definition 12
Let (M, G m ) be an extended graphical suprametric space.Take U : M → M is a mapping on M .Moreover, let G ⋆ be a subgraph of G so that △ is a subset of E(G ⋆ ) .U is a supra-graphical contraction on extended graphical suprametric space M , if and only if the following conditions are met: www.nature.com/scientificreports/ It is worth noting that G ⋆ can be regarded is a weighted graph as it refers to every edge by the distance among their corresponding vertices.The U-Picard iterative sequence {a n } is defined as a n = U a n−1 for all n ∈ N with initial value a 0 ∈ M .For the sake of further investigation, suppose that △ ⊑ E(G ⋆ ) and that G ⋆ is a subgraph of G .We'll also make use of the subsequent result.
G ⋆ is called to be gratify the property Theorem 13 Assume that (M, G m ) be a complete extended graphical suprametric space and U : M → M be a supra-graphical contraction on M .Consider that the subsequent assertions are true: , where ℓ should be in N. G 2 .The graph G ⋆ gratifies the property (P ⋆ ) , and a ⋆ ∈ M in such a way that the U-Picard sequence {a n } with As a result, U has a fixed point.
Proof.Starting from a 0 ∈ M such that U a 0 ∈ [a 0 ] ℓ G ⋆ and utilizing the sequence {a n } with initial value a 0 , then there is a path and by utilizing the supra-graphical contraction, we get, By continuing in the same process, we get, By the use of triangle inequality (T 3 ) , which yields that, By repeating similar process, we get, Considering the insight that G ⋆ -termwise connected sequence, we obtain: Vol.:(0123456789)  www.nature.com/scientificreports/Since γ ∈ [0, 1) , one can easily prove that the series ∞ i=0 S i converges as per ratio test, where Hence, we deduce that G m (a n , a m ) → 0 as n, m → ∞ , which yields that the sequence {a n } is Cauchy.Since M is complete, subsequently suggests that the sequence {a n } converges in M and from Definition 12, i.e., G ⋆ gratifies the property-(P ⋆ ) , there is a ⋆ ∈ M and n 0 ∈ N such that (a n , a ⋆ ) ∈ E(G ⋆ ) or (a ⋆ , a n ) ∈ E(G ⋆ ) for all n > n 0 and lim n→∞ G m (a n , a ⋆ ) = 0, which shows that {a n } converges to a ⋆ .By using the assertion C 2 and inequality 2 when (a n , a ⋆ ) ∈ E(G ⋆ ) then we have, That is, lim n→∞ G m (a n+1 , U a ⋆ ) = 0, this gives {a n } converges to both a ⋆ and U a ⋆ .Thus the U-Picard sequence {a n } having initial value a 0 and it is converges to a ⋆ and U a ⋆ .As a ⋆ ∈ M and U a ⋆ ∈ U (M) , this gives U a ⋆ = a ⋆ as per property (P) .This shows that a ⋆ is a fixed point U.
A collection that includes all fixed-points associated with the mapping U can be represented as Fix(U ) , therefore we employ the form of the notation M U specified as: Clearly G m is an extended graphical suprametric space on M where ϑ : www.nature.com/scientificreports/such that U 1 2 = 1 2 ℓ G ⋆ and the supra-graphical contraction for γ = 1 2 , consequently U is a supra-graphical contraction for γ = 1 2 on U .It is quite clear that "0" is the unique fixed-point and all of the requirements of Theorem 13 are satisfied.
Above Fig. 6 is a weighted graph for n = 4 which demonstrates the above Example 14 The corresponding value of the variance between the left and right sides of Example 14 of Theorem 13 is as shown in Fig. 7. Now we prove that supra-graphical contraction is continuous through an example.
Example 15 Let (M, G m ) be an extended graphical suprametric space as defined in Example 14.Let U : M → M is a supra-graphical contraction.Then U is continuous.
Let {a n } = 1 2 n be a sequence in M for all n ∈ N .We have Thus, as "0" is a limit of the sequence { 1 2 n } , we have U (0) is a limit of the sequence {U 1 2 n }.

Corollary 16
Assume that (M, G m ) be a complete graphical suprametric space and U : M → M be a supra- graphical contraction on M .Consider that the subsequent assertions are true: , where ℓ should be in N. G 2 .The graph G ⋆ gratifies the property (P ⋆ ) , and a ⋆ ∈ M in such a way that the U-Picard sequence {a n } with a 0 ∈ M is G ⋆ -termwise connected.Furthermore, it is converges to a ⋆ and U a ⋆ .G 3 .The quadruple (M, G m , G ⋆ , U ) satisfies the property (P) , i.e., if G ⋆ -termwise connected U-Picard sequence {a n } having limits a ⋆ , b ⋆ , in which a ⋆ ∈ M and b ⋆ ∈ U (M) , which implies a ⋆ = b ⋆ .
As a result, U has a fixed point.

Applying graphical structures in automic control systems
Take an airplane that carefully follows a piece of terrain as a prime instance.To keep things simple, we should simply consider a couple of variables, namely the horizontal distance and height of flight, to ensure that the airplane flies according to its pitch zone.Both a radar altimeter and a radar will be there as well monitoring the landscape up ahead.There will be certain limitations on aircraft acceleration, which are merely restrictions on the radius of the flight path's curvature at specific speeds.The most permissible slope of the flight to the horizontal might also have an upper bound.It is hypothetically feasible to create the necessary flight route for the airplane using this information in conjunction with a specified target clearance for the ground.It will be presumed that the work was successfully accomplished and that the necessary flight path S (a) is known to be a function of horizontal distance, a .Then, take into account the issue of automatically producing the flight path.Figure 8 demonstrates the system's block diagram.If the box labeled " C " is taken to be a unit of storage and delay, it is important to take note of it.
The configuration of the flight controls, which includes the signal for the elevator control, is commonly known as the control function S (a) .The function ϕ(a) depicts the flight path as the consequence of the control ψ(a) .Therefore, the position of the angle in relation to the horizontal throughout the flight path can potentially be represented by ϕ(a) .As indicated in the figure, the precise airplane location φ(a) has been included to ψ(a) and given right back for verification to determine the necessary route S (a) .The signal κ(a) is then generated and held in the box denoted by C unless it gets released and turns into the newly created control function ψ(a).
To distinguish between sequentially created functions ψ(a) , the latter is going to be assigned a suffix i.
The system will function in such a way that starting with an arbitrary control function ψ 0 (a) , the necessary control function ψ(a) will eventually be developed immediately at this point:

Since then
The right-hand side of the expression must be a supra-graphical contractive mapping in order to allow the recursive procedure outlined in Eq. ( 4) to reach convergence.The solution is then That is, S (a) = HAψ(a) = φ(a) , from Eq. ( 3).
In the context of simple terms, the control function is set up to achieve the intended outcome, namely that the real position φ(a) meets the appropriate trajectory S (a).
Establish the graph G and Evidently, the pair (M, G m ) is an extended graphical suprametric space and G m : ; where ξ(K, L ) is a graphical metric and ω is a positive real number, for all K, L ∈ M .Obviously (M, G m ) is complete extended graphical suprametric space.Note that ξ(K, L ) = |K − L |.
Allow the plane to fly with an identical speed W . Assuming a flight angle φ(a) , the height ϕ(a) over the datum corresponds to follows:  www.nature.com/scientificreports/ The following formula can be used to model the airplane dynamics after appropriate streamlined features, Each prefix i within the recursive scheme is valid in this instance.Assume that ρ and σ are the equation's roots.

and put
For a given speed, a is a function of and hence ϕ, ψ are functions either of a or of .Then, from Eq. ( 6), Thus, A and H in Eq. ( 4) are specified.
Let the function HA , where I is the identity function from M to M. Now to prove that the control function is in such a way that the real position φ(a) identical to the S (a) , we need to prove that the right side of Eq. ( 4) is supra-graphical contraction.Consider, + 1 < 1 for all i, a .In other words, www.nature.com/scientificreports/However, from Eq. ( 5),

Since, by taking
where m is a positive number.Then, From inequality 9 and physical considerations, when ψ(a) increases, ϕ(a) decreases and vice versa.We get Thus supra-graphical contraction satisfies for It follows that right side of Eq. ( 4) satisfies supra-graphical contraction.Hence the solution is, Therefore, throughout this range, the necessary ψ(a) algorithm may be developed automatically.
To gain a clearer understanding of m in inequality 10, it will be noted that The upper limit of dφ da 2 is set by the limitations on aircraft acceleration, while dϕ d and dψ d are related through Eq. ( 6), consisting of the aircraft dynamics.As a result, m is associated with identical parameters, and inequality 11 determines a − a 0 for a reasonable value of m.
It has already been demonstrated that provided equality 4 is a supra-graphical contractive mapping, a suitable control function is able to be developed automatically.Once this aspect has been accomplished across the range a − a 0 provided by inequality 11, starting from a point a 0 , a different starting point a 1 is able to be identified, and the procedure continued up to the expected ψ(a) is recognized throughout the complete range.The value of in inequality 2 determines how quickly the recursive procedure in equality 4 converges.The convergence occurs more quickly regardless of the value of γ .This may be observed in inequality 2 and equality 8 that, γ seems correlated with m in turn.In fact, γ is the value of in the expression, Hence,  is to -1, the smaller is γ .In that case, Wm(a − a 0 ) in inequality 11 ideally, be +1 or near to it.
Figure 8 is a automic flight-path generator block diagram.Both of the parameters range a − a 0 and the rate of convergence can be adjusted for one another.It should be emphasized that the need for a graphical supracontractive mapping determined hereunder depends on the existence of the terrain function, S (a) .As a result, the necessary control function is able to be generated for many types of terrain using the identical framework and hardware.Due to the " tanϕ " in Eq. ( 5), the framework that is taken into consideration in relation to the terrain adhering to is non-linear.As previously established, this is not something that restricts the usefulness of graphical supra-contractive mapping.It is not stated that the aforementioned approach is the only one that may be used to resolve the difficulty or that the terrain-following problem has been fully resolved.The graphical supra-contractive mapping, nevertheless, has already been demonstrated to be useful to the automatic process of creating control functions in both nonlinear and linear systems.
Whenever the hardware responds quickly enough across the appropriate range, a method similar to that in Figure 8 could be utilized in an aircraft.It might additionally be employed in structure, modeling, and training studies.The terrain function, S (a) , unambiguously impacts the control function, ψ(a) , so whenever the latter shifts, the former is automatically updated.The control system can be called adaptive in this sense.

Applying graphical structures in control system optimization
Take into account the following equations for the linear, time-varying system with state vector a( ) of dimension n, output vector ( ) of dimension r and, control vector z( ) of dimension m: P ( ) is a matrix which constitutes n × n order, Q ( ) is a matrix which constitutes n × m order, ( ) is a matrix which constitutes r × n order, and T ( ) is a matrix which constitutes r × m order since all the matrices have compatible properties.Controlling the system to produce an outcome that is reasonably near to the intended result d ( ) is the goal.The method of estimation for error e( ) is as outlined below: Control of energy must be restrained in order to lower the cost functional F while pursuing the goal, which included First consider the potential of impulsive functions in γ ( ) for the purpose of foreseeing the need for restricting the terminal state and take where, B ( ) be piecewise continuous function.X ( ) 's components either correspond to impulse functions θ ij ψ( − T) or zeros.When Eq. ( 17) is used in place of Eq. ( 16), the cost function yields, The variables corresponding to θ ij make up the data elements of the constant matrix X in this instance.Subse- quently, it is important to note that the Eq. ( 16) consequently incorporates the final outcome of control system together with the minimal energy issue-Balakrishna et al., 23 looked into this.The primary component of Eq. ( 18) implicitly takes into consideration the weighting of a terminal state as necessary.The integral Eq. (18), which uses the function z( ) , must now be constrained to a function space that guarantees the control energy's exist- ence.With regard to the sake of argument, it is taken into account that z( ) is an element of the m-dimensional Hilbert space H m that is characterized by the product space {L 2 ( 0 , T)} m of square-integrable functions in the range [ 0 , T] that includes the norm of a parameter z( ) with the representation of ||z( )|| can be determined by the inner product as follows:    www.nature.com/scientificreports/ The notion of " �κ, Y� = �Y, κ� " refers to the inner product of two separate components κ and Y in H m which can be described as follows: We need to ensure that e( ) is square-integrable because we have limited our study to functions z( ) in H m and primarily for the reason we need the whole integral under Eq.( 18) to exist.In particular, we insist whether e( ) belongs to the closed range [ 0 , T] of square-integrable functions in the r-dimensional Hilbert space H r .The procedures suggested under Eqs.( 13) and ( 14) need to transform functions from z( ) in H m through functions from e( ) in H r with the aim to satisfy this criterion.To accomplish this, as per emphasized in 24 and provides the general solution to Eq. ( 13).
where �( , 0 ) be a classical transition matrix which gratifies Thus, from Eqs. ( 14), ( 15) and ( 21), we obtain Under preconceived notions, the primary component is automatically in H r .We determine the second term's norm to determine its position and the outcomes that follow: where γ i are the eigenvalues of S ′ ( ), S ( ) .Therefore, and that where S z is in H r .By replacing S ( ) by R ( )�( , 0 ) and assuming that a( 0 ) = ̺ < ∞ , as a result, we have that R ( )�( , 0 )a( 0 ) is in H r .
After replacing R ( )�( , ς)Q (ς) with H( , ς) , it is demonstrated that the following condition must be met in order to allow the integral operator to map a component of H m into a component of H r , where {s ij } are the components of H( , ς) .Considering that scenario , we can rewrite Eq. ( 23) as during which an operator mapping is L .Furthermore, the element z ∈ H m to a specific a ∈ H r where it is supplied by where the integral of the operator H has been designated with

It is now expedient to let
In the current instance, the variation between the output that is wanted and the output generated by the initial conditions is represented by ℘ ( ) .The cost function Eq. ( 16) now states as follows: Since the γ must be symmetric for the standard quadratic form, γ ′ = γ , and therefore γ corresponds to the adjoint of γ ′ , namely γ ⋆ , this has an outcome of where, L ⋆ is the adjoint of L .In other terms, where In order to find the optimum z , defined z ⋆ , so that take z = z ⋆ + µ .Thus, (L ⋆ γ L + A ) is self-adjoint.As a result, from Eq. ( 29) we get, The last term in Eq. ( 31) is nonnegative for any µ since the operator (L ⋆ γ L + A ) additionally happens to be positive definite.As a result, in order for F (z ⋆ ) to be less than F (z) for any given µ , the following conditions must be met: The optimizing equation, additionally referred to as Eq.(32), specifies the optimal control z ⋆ .Considering a quad- ratic cost function, A must be positive definite, thus it possesses a bounded inverse, A −1 .As a result, we have, The task at hand is to solve the integral equation for z ⋆ .
In order to get above, let M be the set of all functions z( ) defined on the interval The optimization equation 33 is to be solved by application of the Theorem 13.Let us define the operator U : M → M by We will prove that there exist a unique solution for Eq.(33) by using the Theorem 13 if the following conditions satisfies: 1.
2. Construct the iteration scheme as below: Consider, which yields that Thus, all of the requirements of Theorem 13 are met, and as a result, U has a unique fixed-point, leading to the unique solution that fulfills Eq. (33).

Conclusion
The notion of graphical structures in extended suprametric space is presented in this article, along with a contractive mapping result for such a space.In adaptive systems, a recursive algorithm for graphical notions has been utilized to construct a desired output function iteratively after defining particular requirements to ensure the existence of the solution through the use of supra-graphical contractive mapping.In light of this, existence proofs are very important in practice, particularly when dealing with nonlinear problems like adaptive and optimal control systems.For futuristic research, a similar method can be applied to autonomous vehicle driving control systems and an optimal control problem for different mathematical models in the context of graphical notions.

Figure 1 .
Figure 1.A plot that depicts the vertices and edges.

Figure 2 .
Figure 2. A sample graph represents connections in the online community.

Example 5
Take M = {0, 1 2 , 1} and µ be a graph metric on M defined as µ(a, b)= |a − b| for all a, b ∈ M .Define G m : M × M → R + as G m η (a, b) = µ(a, b)(µ(a, b) + η) for any real number η. Define ϑ : M × M → [1, ∞)by ϑ(a, b) = e a+b .Let M be endowed with a graph G with M = V (G ) as the collection of vertices and the edge set provided below:then (M, G ) is an extended suprametric space with ϑ(a, b) = e a+b and η = 1 , confining the graph G as explained in Fig.4.But it is not an graphical suprametric space with θ = 1 3

Definition 6
Consider a extended graphical suprametric space (M, G m ) .Take a ∈ M and ε > 0 .Then G m -open ball having center a 0 and radius ε is Similarly, G m -closed ball having center a 0 and radius ε is

Figure 7 .
Figure 7. Plot for the corresponding value of the variance between the left and right sides of Example 14 of Theorem 13.

(
[ 0 , T] as explained in above scenario.Establish the graph G and G ⋆ by G = G ⋆ , V (G ) = M and Define G m : M × M → R by with ϑ(a, b) = e a+b , where ϑ : M × M → [1, ∞) clearly (M, G m ) is an extended graphical suprametric space.