Enhancing structural health monitoring with machine learning for accurate prediction of retrofitting effects

1.   Introduction

Traditional mathematical methods are frequently unable to address a wide range of complicated problems that arise in a variety of fields, including economics, engineering, sociology, medicine, environmental science, and many others. This is because many problems are inherently vague and uncertain. Uncertainty related issues and situations are dealt with using an antiquated and powerful instrument of probability theory, which is only appropriate when the occurrence of events is solely determined by chance. Along with probability theory, additional well-known theories have been created to address uncertainty, including fuzzy sets, intuitionistic fuzzy sets, rough sets, soft sets, and combinations of these theories.

The idea of fuzzy sets, which Lotfi. A. Zadeh ^[1] introduced in 1965, has shown to be a highly effective theoretical solution to ambiguity and vagueness. This idea is founded on fuzzy membership functions, which depict an element's membership in a set. By focusing on the fuzzy information granularity, fuzzy set theory can be utilized to obtain, simulate, and even explain the fuzziness in many practical materials of information. Almost all areas of mathematics, medicine, engineering, and other fields have had concepts reinterpreted using fuzzy sets as a result of their extensive uses.

Pawlak ^[2] proposed the theory of rough sets in the early 1980's which is another nice mathematical tool dealing the set's approximation for dealing with the uncertainty of imprecise data and vagueness. Given the facts at hand, this idea is the best replacement for fuzzy set theory and tolerance theory. Rough sets and fuzzy set theory are two distinct approaches used to address the ambiguity, imprecision, and haziness of real-world situations. Each of these theories has its inherent limitations. Many applications together with machine learning, data mining, knowledge discovery and pattern recognition can be found in ^{[3,4,5,6,7,8]}. The fundamental idea of traditional rough set theory is the lower/upper approximation concept, which is typically based on equivalence relations and partitions. Sometimes dealing with a real-world issue while constrained by an equivalence relation is challenging. In order to tackle such kind of situations, the concept of rough set has been extended to the notion of covering rough sets introduced in ^{[9,10,11,12,13,14,15]} which are an important generalizations of classical and traditional rough sets by relaxing partition of universe to covering. A more all-encompassing notion used to handle the attribute subset is covering, which is a method to expand any partition. Covering-based rough sets are more rational and logical than traditional rough sets for addressing uncertainty related issues, and this theory has attracted significant attention and produced numerous useful research outcomes.

In 1999, Molodtsov ^[16] introduced the concept of soft sets which is a very new and effective mathematical technique for handling uncertainties. It is a set connected with parameters and has been used in many different contexts. Several methods have been developed for addressing the imprecision, uncertainty, and ambiguity of real-world situations including fuzzy set theory, the rough, soft sets and blend of these theories. Each of these theories comes with certain built in drawbacks. ^{[14,15,16,17,18,19,20,21]} has several uses, including machine learning, data mining, pattern detection, and knowledge discovery.

In order to establish an applicable mathematical systems for covering-based rough set and promote its applications in various fields of life, it has been linked with some other theories like fuzzy set theory, soft set theory, neutrosophic set theory, graph theory and blend of theories ^{[7,14,21,22,23,24]}. The notion of a family of fuzzy complementary $\beta$-neighborhood and thus four types of covering-basedoptimistic (pessimistic) multigranulation fuzzy rough sets models are presented in ^[25]. Also, four new kinds of covering-based M-optimistic (pessimistic) multigranulation fuzzy rough sets models are constructed. Some characterizations of these models and its relation with Zhan's model are studied.

Lattice theory and partial order play an important role in many fields of engineering and computer science and they have many applications in distributed computing, that is, vector clocks and global predicate detection, concurrency theory, occurrence nets and pomsets, programming language semantics (fixed-point semantics), and data mining^[26]. They are also useful in other disciplines of mathematics such as combinatorics, group theory and number theory. Many authors have combined the rough set theory and lattice theory, and some useful results have been obtained. Based on the existing works about the connection of rough sets and lattice theory, Chen et al. ^[4] used the notion of covering to define the approximation operators on a completely distributive lattice and set up a unified framework for generalizations of rough sets. Shah et al. ^[27] discussed another approach to roughness of soft graphs with applications in decision making, see also ^{[19,24,28,29,30,31]}. Rough approximation models via graphs based on neighborhood systems can be seen in ^[32]. Some applications of soft graphs linked with rough sets and soft sets can be seen in ^{[27,33,34,35,36]}. Further, the concept of dual hesitant fuzzy graphs (DHFGs$)$ proposed by ^[37], where a two-stage MADM approach is constructed by means of DHFGs for addressing complicated MADM situations with correlations and prioritization relationships. He et al. ^[38] revised the "tight" bounds for path-factor critical avoidable graphs. Since the avoidable graph is a special case of deleted graphs, a link is established between the path-factor critical graph and the path-factor deleted graph. In ^[34], Praba defined a novel rough set called minimal soft rough set by using minimal soft description of the objects. They also analyzed the relation between modified soft rough set and minimal soft rough set. They proposed a lattice structure on minimal soft rough sets. Uncertainty measures associated with neighborhood based soft covering rough graphs such as roughness measure, entropy measure and granularity are proposed in ^[36]. Atef and Nada ^[39] introduced the concept of the complementary fuzzy soft neighborhood as a generalization of Zhan's method, which increases the lower approximation and decreases the upper approximation. As a result, three new types of soft fuzzy rough covering models are constructed. These constructions' properties are discussed. They define three categories of fuzzy soft measure degrees in light of these results. A decision-making algorithm is then described based on the suggested operations, and its performance is illustrated with a numerical example. Further the relationships among these three models and Zhan's model are presented ^[39,40]. $\mathcal{L}\mathfrak{i}$ and Zhu ^[11] introduced the lattice structures of fixed points of the lower approximations of two types of covering-based rough sets in which they discussed that under what conditions two partially ordered sets are some lattice structures. They defined two types of sets called the fixed point set of neighborhoods and the fixed point set of covering, respectively. Fixed points of covering upper and lower approximation operators are introduced in ^[41] in which by using some results about the Feynman paths, they have shown that the family of all fixed points of covering upper and lower approximation operators is an atomic frame and a complete lattice, respectively.

$Z$-soft rough covering models introduced by Zhan et al. ^[42] are important generalizations of classical rough set theory to deal with data structure and more complex problems of the real world. It can be seen in ^[43] that the $CSR$ approach uses property soft neighborhoods to establish models that successfully grow the lower approximation and lower the upper approximation and study the relationships between these models and some of the topological properties based on the $CSR$ approach. In order to solve MGDM problems, they finally developed an algorithm for the presented model. Different kinds of uncertainty measures related to $\mathcal{L}\mathfrak{i}$-soft rough covering sets and their limitations are presented in ^[44]. The concept of fixed point sets by using $Z$-soft rough covering models is introduced by Imran et al. ^[45], where they have discussed different algebraic structures along with their limitations connecting both lattices and $Z$-soft rough covering models. The purpose of introducing soft graphs is to discretize these fundamental mathematical ideas, which are inherently continuous, and to provide new tools for applying mathematical analysis technology to real-world applications including imperfect and inexact data or uncertainty. $\mathcal{L}\mathfrak{i}$ et al. presented the idea of soft rough covering models (briefly, $\mathcal{SRC}$-Models), a novel theory that addresses uncertainty. Two new notions have been introduced in the current paper. $\mathcal{L}\mathfrak{i}$-soft rough covering graphs ($\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s) and the notion of fixed point sets, also known as $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ sets of such graphs. Several types of approximation operators and their related properties are discussed using $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s. We also investigated a few algebras that dealt with the fixed points of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s. Applications of the algebraic structures available in covering soft sets to soft graphs may open up new areas of graph theory. We go over the prerequisites for the family of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ sets acquiring lattice structure, distributive lattice, complete lattice, and some algebra pertaining to soft graphs. This paper is organized as follows.

The basics of rough sets, covering soft sets, $\mathcal{L}\mathfrak{i}$-soft rough covering models, lattices and soft graphs are reviewed in Section $2$ of this article. In Section 3, we define the concept of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s, $\mathcal{L}\mathfrak{i}$-soft reduct of covering soft sets, and their attributes based on $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s. Further, we investigate the conditions in which the soft neighborhood $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ sets transform into particular lattice structures. In Section 4, we explore the idea of soft graphs'$\mathcal{L}\mathfrak{i}$-soft rough covering fixed point sets ($\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ sets). We have talked about the idea of bounds for any two $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s elements. Several algebraic structures related to $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s are also addressed. In Section 5, we finally put our paper to conclusion.

2.   Preliminaries

This section provides a succinct review of certain essential concepts, results, and core ideas that will be useful in comprehending the remaining chapters of this thesis. The universe $V$ is assumed to be a non-void finite set throughout this article, along with the void (empty) set $\emptyset$ and $R$, the parameter's set.

Definition 2.1. A family $C$ of non-void subsets of $U$ is said to be a covering of $U$ if $\ \bigcup C = U.$ Also, for a subset $Y$ of $U,$ the sets

(i) given below, denoted by $L_{{ C}}(\mathcal{Y})$ and $H_{_{{ C}}}(\mathcal{Y}),$ are called respectively, the second type covering lower and upper approximation of $Y$,

(ii) given below, denoted by $F_{\mathfrak{L}}(\mathcal{Y})$ and $F_{\mathcal{H}}(\mathcal{Y}),$ are called respectively, covering lower and upper approximations of sixth type of $Y$

where $N\left(x\right) = \bigcap \{Q\in C:x\in Q\}$ is called neighborhood of $x$ with respect to $C.$

Proposition 2.1. For any subset Y of U, the following laws always hold true:

(i) $F_{\mathfrak{L}}\left(\mathcal{\emptyset }\right) = \emptyset$ and $L_{{ C}}\left(\mathcal{\emptyset }\right) = \emptyset$

(ii) $F_{\mathfrak{L}}\left(\mathcal{U}\right) = U$ and $L_{{ C}}\left(\mathcal{U}\right) = U$

(iii) $F_{\mathfrak{L}}\left(\mathcal{Y}\right) \subseteq Y$ and $L_{ { C}}\left(\mathcal{Y}\right) \subseteq Y$ $\left(iv\right)$ $F_{\mathfrak{L}}\left(\mathcal{F}_{\mathfrak{L}}\left(\mathcal{Y}\right) \right) = F_{\mathfrak{L}}\left(\mathcal{Y}\right)$ and $L_{{ C} }\left(\mathcal{L}_{{ C}}\left(\mathcal{Y}\right) \right) = L_{ { C}}\left(\mathcal{Y}\right)$ $\left(v\right)$ $Y\subseteq X$ implies $F_{\mathfrak{L}}\left(\mathcal{Y}\right) \subseteq F_{\mathfrak{L} }\left(\mathcal{X}\right)$ and $L_{{ C}}\left(\mathcal{Y} \right) \subseteq L_{{ C}}\left(\mathcal{X}\right)$ $\left(vi\right)$ for all $K\in C,$ $F_{\mathfrak{L}}\left(\mathcal{K}\right) = \left(\mathcal{K}\right)$ and $L_{{ C}}\left(\mathcal{K} \right) = L_{{ C}}\left(\mathcal{K}\right).$

Definition 2.2. Let $\tau :R\rightarrow P\left(\mathcal{U}\right)$ is a set valued mapping, then the ordered pair $T = \left(\mathfrak{\pi, R}\right)$ is called a soft set over U. In this case, the pair $D = \left(\mathcal{U}, \mathfrak{T}\right)$, is called soft approximation space $\left({briefly, }\mathcal{SAS}\right).$

Definition 2.3. A soft set $\left(\mathfrak{\tau, R}\right)$ is called covering soft set $\left({ briefly, }\mathcal{CSS} \right)$if

(i) it is full, that is, if $\bigcup\limits_{\sigma \in \mathfrak{R}}\tau \left(\sigma \right) = U$ and,

(ii) for every $\sigma \in R,$ $\tau \left(\sigma \right) \neq \emptyset$.

In such case, the ordered pair $T = \left(\mathcal{U}\text{, } \mathbb{C} _{_{\mathcal{V}}}\right)$ is called $\mathcal{SCAS}$ $\left({soft\ covering\ approximation\ space}\right).$ Then, for W$\subseteq U$, the following two sets:

In the above sets the operators $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right)$ and $\overline{\mathcal{F} _{_{\mathcal{T}}}}\left(\mathcal{W}\right)$ are called respectively, $\mathcal{L}\mathfrak{i}\mathcal{-SCLA}$ operator and $\mathcal{L}\mathfrak{i} \mathcal{-}\mathcal{SCU}\mathcal{A}$ operator.

Definition 2.4. A partial ordered set (or briefly, a poset) is an ordered pair $(\mathfrak{L}, \preceq),$ consisting of a non-void $\mathfrak{L}$ and a partial order $\preceq$ on $\mathfrak{L.}$

Definition 2.5. A lattice is a poset $(\mathfrak{L}, \preceq)$ in which $a\wedge b = \inf (a, b)$ and $a\vee b = \sup (a, b)$ exist for any pair of elements $a$ and $b$ of $\mathfrak{L.}$ Also, $\mathfrak{L}$ is said to have a lower bound $0$ if and only for any $t$ in $\mathfrak{L}$ we have, $0\preceq t.$ Analogously, $\mathfrak{L}$ is said to have an upper bound $1$ if and only for any $t$ in $\mathfrak{L}$ we have, $t\preceq 1.$ A lattice $(\mathfrak{L}, \preceq)$ is bounded if and only if has both $0$ and $1.$

Definition 2.6. A lattice $(\mathfrak{L}, \preceq)$ is said to be distributed if and only if for any $a,$ $b$, $t$ in $\mathfrak{L}$ we have, $a\wedge \left(b\vee t\right) = \left(a\wedge b\right) \vee \left(a\wedge t\right)$ and $a\vee \left(b\wedge t\right) = \left(a\vee b\right) \wedge \left(a\vee t\right)$. Otherwise, $(\mathfrak{L}, \preceq)$ is said to be non distributive.

Definition 2.7. Let $0$ be a lower bound and 1 be an upper bound in a lattice $\left(\mathfrak{L}, \preceq \right)$. An element $p$ in $\mathfrak{L}$ is said to be

(i) join irreducible if $p = a\vee b$ implies $p = a$ or $p = b.$

(ii) complement of $t$ if $p\vee t = 1$ and $p\wedge t = 0$.

(iii) pseudocomplement of $t$ $\in \mathfrak{L}$, if $p\wedge t = 0$ and for all $r$ $\in \mathfrak{L, }$ $t\wedge r = 0$ implies $r\preceq p.$

(iv) dual pseudocomplement of $t$ $\in \mathfrak{L, }$ if $p\vee t = 1$ and for all $r$ $\in \mathfrak{L, }$ $t\vee r = 1$ implies $p\preceq r.$

Definition 2.8. A lattice $(\mathfrak{L}, \preceq)$ is said to be

(i) complemented if it is $\left(a\right)$ bounded and $\left(b\right)$ every element of $\mathfrak{L}$ has a complement $;$

(ii) pseudocomplemented (briefly, $pseud^{Cd}$) if every member of $\mathfrak{L}$ has pseudocomplement;

(iii) a Stone algebra if it is a lattice which is $\left(a\right)$ distributive $\left(b\right)$ $pseud^{Cd}$ and (c) satisfying the identity $p^{\ast }\vee p^{\ast \ast } = 1,$ for all p $\in \mathfrak{L, }\left(where\text{ }p^{\ast }is\text{ } pseudocomplemented\text{ of }p\right)$;

(iv) a dual pseudocomplemented (briefly, D-pseud$^{Cd}$) if each of its member has dual pseudocomplement;

(v) a dual Stone algebra, if the lattice meets the conditions of being (a) distributive $\left(b\right)$ D-$pseud^{Cd}$, and $\left(c\right)$ satisfying the identity (dual Stone identity) $p^{\ast}\wedge p^{\ast \ast } = 1,$ for all p $\in \mathfrak{L}$;

(vi) a double p-algebra if it is simultaneously $\left(a\right)$ $pseud^{Cd}$ and $\left(b\right)$ D-$pseud^{Cd}$;

(vii) a double Stone algebra, if it is (a) Stone algebra and $\left(b\right)$ dual Stone algebra.

Definition 2.9. Let $\Omega = \left(\mathcal{V} \text{, }\mathcal{E}\right)$ be a graph. Then, a quadruple $\Theta = \left(\Omega, \mathfrak{\delta, \gamma, R}\right)$ is called a soft graph, provided

(i) $\mathfrak{\delta :R\rightarrow P}\left(\mathcal{V} \right)$ is a soft set over vertex $\mathcal{V};$

(ii) $\mathfrak{\gamma :R\rightarrow P}\left(\mathcal{E} \right)$ is a soft set over $\mathcal{E}$ and for every $\mathfrak{\sigma \in R, }$ the pair $H = \left(\mathfrak{\delta }\left(\mathfrak{\sigma } \right), \mathfrak{\gamma }\left(\mathfrak{\sigma }\right) \right)$ represents a subgraph of $\Omega$.

Further, if $\Theta$ is a soft graph such that

(a) $\bigcup\limits_{\mathfrak{\sigma \in R}}\mathfrak{\delta }\left(\mathfrak{\sigma }\right) = \mathcal{V}$, then $\Theta$ is called full soft vertex graph;

(b) $\bigcup\limits_{\mathfrak{\sigma \in R}}\mathfrak{\gamma }\left(\mathfrak{\sigma }\right) = \mathcal{E}$, then $\Theta$ is called full soft vertex graph;

(c) $\left(\bigcup\limits_{\mathfrak{\sigma \in R}}\mathfrak{ \delta }\left(\mathfrak{\sigma }\right), \bigcup\limits_{\mathfrak{\sigma \in R}}\mathfrak{\gamma }\left(\mathfrak{\sigma }\right) \right) = \left(\mathcal{V}, \mathcal{E}\right),$then $\Theta$ is called full soft graph.

3.   $\mathcal{L}\mathfrak{i}$-soft rough covering graphs and their fixed points

$\mathcal{L}\mathfrak{i}$-$SRC$ sets are significant mathematical tools for addressing challenges in real world that involve uncertainty. Another useful tool for displaying information through matrices, relations, and diagrams is graph theory, which has obvious applications. This section focuses on the description of a novel blend of $\mathcal{L}\mathfrak{i}$-soft rough covering sets and graphs, called $\mathcal{L}\mathfrak{i}$-soft rough covering graphs $\left(\mathcal{L}\mathfrak{i}\text{-}\mathcal{SRCG}\text{s}\right)$. This approach will assist us discuss the idea of uncertainty in these concepts as well as improve the application of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRC}$ sets and soft graphs. It is shown that the family of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ sets is a lattice. We have also proposed some basic properties and related examples in details.

Definition 3.1. Let $\Theta \ $be a $\mathcal{CSV}$ -$G$raph and $Q = \left(V, \mathbb{C} _{\mathcal{V}}\right)$ be a $\mathcal{SVCAS}$. Then, for any $W\subseteq V$, $\mathcal{SVCL}$ and $\mathcal{SVCU}$ approximation operators are respectively, defined as:

In the above sets, the operators $\underline{\mathcal{F}}_{_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}}\left(\mathcal{W}\right)$ and $\overline{\mathcal{F} _{_{\mathcal{T}}}}\left(\mathcal{W}\right)$ are called respectively, $\mathcal{L}\mathfrak{i}$-$\mathcal{SVCL}$ operator and $\mathcal{L}\mathfrak{i}$-$\mathcal{SVCU}$ operator. In case, $\underline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right) = \overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right),$ then $W$ is called $\mathcal{L}\mathfrak{i}$ -soft vertex covering definable, where the graph $G_{_{\mathcal{Q}}}: = \left(\mathcal{V}, \mathcal{E}\right)$ is called $\mathcal{L}\mathfrak{i}$-$\mathcal{SVC}$ definable. But on the other hand, if $\underline{\mathcal{F}}_{_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}}\left(\mathcal{W}\right) \neq \overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right),$ then the set $W$ is called $\mathcal{L}\mathfrak{i}$-$\mathcal{SRVC}$ set and the graph $G_{_{\mathcal{Q}}}$ is called $\mathcal{L}\mathfrak{i}$-$\mathcal{SRVC}$

Example 3.1. Suppose $\Omega = (V, \mathcal{E})$ is a graph given in Figure 1 below, with $V = \left\{ x_{1}, x_{2}, ..., x_{7}\right\}$, $\mathcal{E} = \left\{ e_{1}, e_{2}, ..., e_{10}\right\}$,

Let $Q = \left(\mathcal{V}, \mathfrak{C}_{\mathcal{V}}\right)$ be a $\mathcal{SVCAS}$, where $C_{\mathcal{V}} = \left(\mathfrak{\delta, R}\right)$, $R = \{\sigma _{1}, \sigma _{2}, ..., \sigma _{6}\}$ is parameters set and $\delta :R\rightarrow P\left(\mathfrak{\mathcal{V}}\right)$ is a set valued mapping, presented in Table 1 such that $\delta \left(\sigma _{1}\right) = \left\{ x_{3}, x_{4}, x_{5}\right\},$ $\delta \left(\delta _{2}\right) = \left\{ x_{1}, x_{2}\right\}, \ \delta \left(\sigma _{3}\right) = \left\{ x_{3}, x_{5}, x_{6}\right\},$ $\delta \left(\sigma _{4}\right) = \left\{ x_{3}, x_{4}\right\},$ $\delta \left(\sigma _{5}\right) = \left\{ x_{1}, x_{2}, x_{3}\right\}, \delta \left(\sigma _{6}\right) = \left\{ x_{1}, x_{2}, x_{5}\right\}$,

Then, clearly, the pair $Q = \left(\mathcal{V}, \mathcal{C}_{\mathcal{V} }\right)$ is a $\mathcal{SVCAS}$. Suppose we have a subset $W = \left\{ x_{1}, x_{2}, x_{4}\right\}$ of vertex set $V.$ Then, $\underline{\mathcal{F}} _{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right)$ and $\overline{\mathcal{F}} _{_{ \mathbb{C} _{_{\mathcal{V}}}}}\left(\mathcal{W}\right)$ can be calculated in the following manners:

Since $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right)$ $\neq$ $\overline{\mathcal{F }}_{_{ \mathbb{C} _{_{\mathcal{V}}}}}\left(\mathcal{W}\right),$ so $W$ is a $\mathcal{SVCR}$ and $\Delta _{_{\mathcal{Q}}}: = \left(V, E\right)$ is $\mathcal{L}\mathfrak{i}$-$\mathcal{SRVC}$ -$G$raph with

Note if $W = \left\{ x_{1}, x_{2}\right\} \subseteq V,$ then $\underline{ \mathcal{F}}_{_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}}\left(\mathcal{W}\right)$ $=$ $\overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right) = \left\{ x_{1}, x_{2}\right\}$ showing that $W$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SVC}$ definable set$\underline{\mathcal{F}} _{_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}}\left(\mathcal{W}\right)$ $=$ $\overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right) = \left\{ x_{1}, x_{2}\right\}$. Also,

Definition 3.2. A full soft edge graph $\Theta,$ such that $\gamma \left(\sigma \right) \neq \emptyset$ for all $\sigma \in R,$ is called $\mathcal{CS}E$ $G$raph$.$ In this case, $D = \left(\mathcal{E}, \mathcal{C}_{\mathcal{E} }\right)$ is called $\mathcal{S}E\mathcal{CAS}$.

Definition 3.3. Let $D = \left(E, \mathcal{C}_{\mathcal{E}}\right)$ be a $\mathcal{S}E\mathcal{CAS}$ then, the sets

are called the $\mathcal{L}\mathfrak{i}$-$\mathcal{S}E\mathcal{CL}$ and $\mathcal{L}\mathfrak{i}$-$\mathcal{S}E\mathcal{CU}$ approximations of $\mathcal{N}$, respectively.

Also, if $\overline{\mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right) = \underline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right),$ where $\mathcal{N}$ is a subset of $E$. Then, $\mathcal{N}$ is called $\mathcal{L}\mathfrak{i}$-$\mathcal{S}E\mathcal{C}$ definable set and the graph $\Delta _{ \mathcal{Q}}: = \left(\mathcal{V}, \mathcal{E}\right)$ is called $\mathcal{L}\mathfrak{i}$-$\mathcal{S}E\mathcal{C}$ definable. The graph $\Delta _{\mathcal{Q}}$ is called $\mathcal{L}\mathfrak{i}$-$\mathcal{S}E\mathcal{CAS}$ $G$raph only if $\overline{\mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right) \neq \underline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right).$ In this case, the subset $N$ of $\mathcal{E}$ is called $\mathcal{L}\mathfrak{i}$-$\mathcal{S}E\mathcal{CR}$ set.

Example 3.2. Continued from Example $3.2,$ if $Q = \left(E, \mathcal{C }_{\mathcal{E}}\right)$ represents a $\mathcal{S}E\mathcal{CAS}$ with $\gamma \left(\sigma _{1}\right) = \left\{ e_{1}, e_{3}, e_{5}, e_{10}\right\},$ $\gamma \left(\sigma _{2}\right) = \left\{ e_{4}\right\},$ $\gamma \left(\sigma _{3}\right) = \left\{ e_{4}, e_{5}, e_{6}\right\},$ $\gamma \left(\sigma _{4}\right) = \{e_{1}, e_{2}, e_{5}, e_{6}, e_{10}\},$ $\gamma \left(\sigma _{5}\right) = \{e_{1}, e_{3}\}$ and $\gamma \left(\sigma _{6}\right) = \left\{ e_{6}, e_{7}, e_{9}\right\}$, see Table 2 below.

Let $\mathcal{N} = \left\{ e_{1}, e_{3}, e_{4}, e_{10}\right\} \subseteq \mathcal{ E}$. Then

Here, $\mathcal{N}$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SR}E\mathcal{C}$ set and $\Delta _{\mathcal{D}}: = \left(V, E\right)$ is $\mathcal{L}\mathfrak{i}$-$\mathcal{SR}E\mathcal{CG}$ because $\underline{\mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right)$ $\neq \overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right)$ such that

Definition 3.4. Suppose $\Theta$ is a soft graph. Then, $\Theta$ is called

(i) $\mathcal{L}\mathfrak{i}$-soft covering definable if $\underline{\mathcal{F}}_{_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}}\left(\mathcal{W}\right) = \overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right)$ and $\overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right) = \underline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right)$,

(ii) $\mathcal{L}\mathfrak{i}$-soft rough covering graph $\left({briefly, }\mathcal{L}\mathfrak{i}\text{-}\mathcal{SCR}\text{ } \mathcal{G}{raph}\right)$ if $\underline{\mathcal{F}}_{_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}}\left(\mathcal{W}\right) \neq \overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right)$ and $\overline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right) \neq \underline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{E}}}}}}}\left(\mathcal{N}\right),$ where $\mathcal{W\subseteq V}$ and $\mathcal{N\subseteq E}.$

Definition 3.5. Let $\Theta \mathcal{\ }$be a $\mathcal{CS}E$-$\mathcal{G}$raph such that $\mathcal{Q = }\left(\mathcal{V}, \mathfrak{C}_{\mathcal{V}}\right)$ is a $\mathcal{SVCAS}$ and $\mathfrak{\delta }\left(\sigma \right) \in \mathbb{C} _{v}$. Then, $\mathfrak{\delta }\left(\sigma \right)$ is called $\mathcal{L }\mathfrak{i}$-soft union reducible element $\left({briefly, }\ \mathcal{ L}\mathfrak{i}\text{-}\mathcal{SU}red\ { element}\right)$ if $\mathfrak{ \delta }\left(\sigma _{i}\right)$ is the union of some $\mathfrak{\delta } \left(\sigma _{j}\right) \in _{ \mathbb{C} _{_{\mathcal{V}}}}-\{\mathfrak{\delta }\left(\sigma _{i}\right) \}$ for $i\neq j$. Any other element which is not $\mathcal{L}\mathfrak{i}$-$\mathcal{ SU}red$ element, is called $\mathcal{L}\mathfrak{i}$-soft union irreducible element $\left(\mathcal{L}\mathfrak{i}\text{-}\mathcal{SU}irred\ { element }\right)$. If every $\mathfrak{\delta }\left(\mathfrak{\sigma }_{i}\right) \in \mathbb{C} _{_{\mathcal{V}}}$ is $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element, then $\mathbb{C} _{_{\mathcal{V}}}$ is called $\mathcal{L}\mathfrak{i}$-soft irreducible, otherwise $\mathbb{C} _{_{\mathcal{V}}}$ is called $\mathcal{L}\mathfrak{i}$-soft reducible.

It can be seen that if $\mathfrak{\delta }\left(\mathfrak{\sigma } _{i}\right)$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element of $\mathfrak{C}_{V}$, then $\mathfrak{C}_{V}-\{\mathfrak{\delta }\left(\mathfrak{\sigma }_{i}\right) \}$ is still a covering soft set over the universe set $V.$

Example 3.3. Consider a $\mathcal{CSV}$-$\mathcal{G}$raph $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right)$ where, $\mathcal{V} =$ a finite universe $\left(\text{vertex set}\right) = \left\{ r_{1}, r_{2}, r_{3}, r_{4}\right\}$ and $\mathfrak{R} = \{\sigma _{\mathfrak{1}}, \sigma _{\mathfrak{2}}, \sigma _{\mathfrak{3}}, \sigma _{\mathfrak{4}}\}$ such that $\left(\mathfrak{\delta }, \mathfrak{R}\right)$ is $\mathcal{CSS}$ over $\mathcal{V},$ see below in Table 3, so that $\mathfrak{\delta }\left(\sigma _{\mathfrak{1}}\right) = \left\{r_{1}\right\},$ $\mathfrak{\delta }\left(\sigma _{\mathfrak{2}}\right) = \left\{ r_{2}, r_{3}\right\}, \mathfrak{\ \delta }\left(\sigma _{\mathfrak{3}}\right) = \left\{ r_{1}, r_{2}, r_{3}\right\},$ $\mathfrak{\delta }\left(\sigma _{\mathfrak{4}}\right) = \left\{ r_{2}, r_{4}\right\}$ and $\mathbb{C} _{_{\mathcal{V}}} = \{\mathfrak{\delta }\left(\sigma _{\mathfrak{1}}\right), \mathfrak{\delta }\left(\sigma _{\mathfrak{2}}\right), \mathfrak{\ \delta } \left(\sigma _{\mathfrak{3}}\right), \mathfrak{\delta }\left(\sigma _{ \mathfrak{4}}\right) \} = \{\left\{ r_{1}\right\},$ $\left\{ r_{2}, r_{3}\right\}, \mathfrak{\ }\left\{ r_{1}, r_{2}, r_{3}\right\}, \left\{ r_{2}, r_{4}\right\} \}.$

Clearly, $\mathfrak{\delta }\left(\sigma _{\mathfrak{3}}\right) = \left\{ r_{1}, r_{2}, r_{3}\right\} = \mathfrak{\delta }\left(\sigma _{\mathfrak{1} }\right) \cup \mathfrak{\delta }\left(\sigma _{\mathfrak{2}}\right),$ where $\mathfrak{\delta }\left(\sigma _{\mathfrak{1}}\right),$ $\mathfrak{ \delta }\left(\sigma _{\mathfrak{2}}\right) \in \mathbb{C} _{_{\mathcal{V}}}-\{\mathfrak{\delta }\left(\sigma _{3}\right) \}$ showing that $\mathfrak{\delta }\left(\sigma _{\mathfrak{3}}\right)$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element in $\mathbb{C} _{_{\mathcal{V}}}.$ The elements $\mathfrak{\delta }\left(\sigma _{ \mathfrak{1}}\right), \mathfrak{\delta }\left(\sigma _{\mathfrak{2}}\right)$ and $\mathfrak{\delta }\left(\sigma _{\mathfrak{4}}\right)$ are $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ elements in $\mathbb{C} _{_{\mathcal{V}}}.$

Definition 3.6. Let $\mathcal{CSV}$-Graph be $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right)$ and $\mathcal{Q = }\left(\mathcal{V}, \mathfrak{C}_{\mathcal{V}}\right)$, be a $\mathcal{SVCAS}$. Then, family $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ of subsets of $\mathcal{V}$, defined by $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \{\mathcal{W}\in P\left(\mathcal{V}\right) : \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right) =$ $\mathcal{W}\},$ is called $\mathcal{L}\mathfrak{i}$-soft rough vertex covering fixed point set $\left(\text{briefly }\mathcal{L}\mathfrak{i}\text{-}\mathcal{SRVCFP}\text{ set} \right)$ induced by $\mathbb{C} _{_{\mathcal{V}}}.$

Example 3.4. Consider a $\mathcal{CSV}$-Graph $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right) \mathcal{\ }$as shown in Figures 2 and 3, where $\Omega = \left(\mathcal{V}\text{, }\mathcal{E}\right)$ with vertex set $\mathcal{V} = \left\{ x_{1}, x_{2}, x_{3}, x_{4}\right\}$, $\mathcal{E} = \left\{ e_{1}, e_{2}, ,, , e_{8}\right\}$ and parameters set $\mathfrak{R} = \left\{ \mathfrak{\sigma }_{\mathfrak{1}}, \mathfrak{\sigma }_{\mathfrak{2}}, \mathfrak{\sigma }_{\mathfrak{3}}, \mathfrak{\sigma }_{\mathfrak{4}}\right\}$, $\left(\mathfrak{\delta }, \mathfrak{R}\right)$ is a $\mathcal{CSS}$ over $\mathcal{V},$below in Table 4, so that $\mathfrak{\delta }\left(\sigma _{\mathfrak{1}}\right) = \left\{ x_{1}, x_{2}\right\},$ $\mathfrak{\delta } \left(\sigma _{\mathfrak{2}}\right) = \left\{ x_{3}\right\}, \mathfrak{\ \delta }\left(\sigma _{\mathfrak{3}}\right) = \left\{ x_{1}, x_{2}, x_{3}\right\},$ $\mathfrak{\delta }\left(\sigma _{\mathfrak{4} }\right) = \mathcal{V}.$

Here, $\mathbb{C} _{_{\mathcal{V}}} = \{\left\{ x_{1}, x_{2}\right\}, \left\{ x_{3}\right\},$ $\left\{ x_{1}, x_{2}, x_{3}\right\}, , \left\{ x_{1}, x_{2}, x_{3}, x_{4}\right\} \}.$ Let $\mathcal{W} = \left\{ x_{1}, x_{2}\right\} \subseteq \mathcal{V},$ then $\underline{\mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right) = \cup \{\mathfrak{\delta } \left(\sigma \right) \in _{ \mathbb{C} _{_{\mathcal{V}}}}:\mathfrak{\delta }\left(\sigma \right) \subseteq \mathcal{W}\} = \left\{ r_{1}, r_{2}\right\} =$ $\mathcal{W}$. That is, $\underline{\mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right) = \mathcal{W}$ In this case, $\mathcal{W}$ is a member of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ set or $\mathcal{W\in }$ $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$

Similarly, when $\mathcal{W} = \left\{ r_{1}, r_{2}, r_{3}\right\}$ then $\underline{\mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right) =$ $\mathcal{W},$ showing that $\mathcal{W\in }$ $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$.

Proposition 3.1. Suppose $\Theta = \left(\Omega, \mathcal{\mathfrak{ \delta }}, \mathfrak{\gamma }, \mathcal{R}\right) \mathcal{\ }$is a $\mathcal{ CSV}$-$\mathcal{G}$raph and $\mathfrak{\delta }\left(\sigma \right)$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $\mathbb{C} _{_{\mathcal{V}}},$ then $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \mathfrak{F}_{_{fix}}\left(\left(\mathbb{C} _{_{\mathcal{V}}}\right) -\{\mathfrak{\delta }\left(\sigma \right) \}\right)$.

Proof. By definition, $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \{$ $\mathcal{W}\in P\left(\mathcal{V}\right) : \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right) = \mathcal{W}\}$ and $\mathfrak{ F}_{_{fix}}\left(\left(\mathbb{C} _{_{\mathcal{V}}}\right) -\{ \mathfrak{\delta }\left(\sigma \right) \} \right) = \{ \mathcal{W}\in P\left(\mathcal{V}\right) :\underline{\mathcal{F }}_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}-\{ \mathfrak{\delta }\left(\sigma \right) \}}}}\left(\mathcal{W}\right) = \mathcal{W}\}.$ But $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}\text{-}\{ \mathfrak{\delta }\left(\sigma \right) \}}}}\left(\mathcal{W}\right) = \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right)$ for any $\mathcal{W}\in P\left(\mathcal{V}\right).$ Therefore, $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \mathfrak{F}_{_{fix}}\left(\left(\mathbb{C} _{_{\mathcal{V}}}\right) -\{ \mathfrak{\delta }\left(\sigma \right) \} \right).$ □

Now, the following proposition shows that $\mathcal{L}\mathfrak{i}$-$\mathcal{SRVCFP}$ set with respect to soft covering $\mathbb{C} _{_{\mathcal{V}}}$ is the same as that of one, induced by the reduction of the $\mathcal{ CSS}$ $\mathbb{C} _{_{\mathcal{V}}}$.

Definition 3.7. If every $\delta \left(\mathfrak{\sigma } _{i}\right) \in \mathbb{C} _{_{\mathcal{V}}}$ is $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element, then $\mathbb{C} _{_{\mathcal{V}}}$ is called $\mathcal{L}\mathfrak{i}$-soft irreducible, otherwise $\mathbb{C} _{_{\mathcal{V}}}$ is called $\mathcal{L}\mathfrak{i}$-soft reducible. It can be seen that if $\delta \left(\mathfrak{\sigma }_{i}\right)$ is a $\mathcal{L}\mathfrak{i}$-$SUred$ element of $\mathbb{C} _{_{\mathcal{V}}}$, then $\mathbb{C} _{_{\mathcal{V}}}-\{\delta \left(\mathfrak{\sigma }_{i}\right) \}$ is still a $CSS$ over the universe set V. For $\mathbb{C} _{_{\mathcal{V}}},$ the newly $\mathcal{L}\mathfrak{i}$-soft union irreducible covering soft set with respect to the above reduction, is called $\mathcal{L}\mathfrak{i}$-soft reduct of $\mathbb{C} _{_{\mathcal{V}}},$ and is denoted by $\mathcal{L}\mathfrak{i}$-$S_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$

Proposition 3.2. Let $\Theta = \left(\Omega, \mathcal{\mathfrak{ \delta }}, \mathfrak{\gamma }, \mathcal{R}\right) \ $be a $\mathcal{ CSV}$-Graph and let $\mathbb{C} _{_{\mathcal{V}}}$ is a covering soft set over $V$, then $F_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = F_{_{fix}}\left(\mathcal{L}\mathfrak{i}\mathit{\text{-}} \mathcal{S}_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right) \right).$

Proof. By definition,

Since, $\underline{\mathcal{F}}_{_{_{\mathcal{L}\mathfrak{i}\text{-}\mathcal{ S}_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right) }}}\left(\mathcal{W}\right) = \underline{\mathcal{F} }_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right),$ for any $\mathcal{W}\in P\left(\mathcal{V}\right).$ Thus, $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \mathfrak{F}_{_{fix}}\left(\mathcal{L}\mathfrak{i} \text{-}\mathcal{S}_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right) \right).$ □

The $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$- set induced by $\mathbb{C} _{_{\mathcal{V}}}$ together with the set inclusion, $\left(\mathfrak{F} _{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$, is a POS. Actually, we see that whether this POS is a lattice or not. In the theorem given below, we show that $F_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ ($\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$- set) is a lattice and for any two members of this lattice. And for such lattice, we have find its lub and glb.

Proposition 3.3. Let $Q = \left(\mathcal{V}, \mathfrak{C}_{\mathcal{V }}\right)$, be a $\mathcal{SVCAS}$ for $\mathcal{CSV}$-Graph $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right)$. Suppose, W, $Y\in F_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. Then, $\left(\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is a lattice, where $W\vee Y =$ $W\cup Y$ and $W\wedge Y = \underline{\mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right)$.

Proof. We have to prove only that $\mathcal{W}\cup \mathcal{Y}\in \mathfrak{F} _{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ as well as $\underline{\mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right) \in \mathfrak{ F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ for any $\mathcal{W},$ $\mathcal{Y}\in \mathfrak{F }_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. If possible, suppose $\mathcal{W}\cup \mathcal{Y}$ $\notin$ $\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, then there exists $r\in$ $\mathcal{W}\cup \mathcal{Y}$ such that for all $\mathfrak{\delta }\left(\sigma \right) \in _{ \mathbb{C} _{_{\mathcal{V}}}}$ and $x\in \mathfrak{\delta }\left(\sigma \right)$ implies $\mathfrak{\delta }\left(\sigma \right) \nsubseteq$ $\mathcal{W} \cup \mathcal{Y}.$ Since $r\in$ $\mathcal{W}\cup \mathcal{Y}$, so $r\in$ $\mathcal{W}$ or $r\in \mathcal{Y}$. Hence $\mathfrak{\delta }\left(\sigma \right) \nsubseteq$ $\mathcal{W}$ or $\mathfrak{\delta }\left(\sigma \right) \nsubseteq$ $\mathcal{Y}$, that is, $r\notin \underline{\mathcal{F}} _{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{W}\right)$ or $r\notin \underline{ \mathcal{F}}_{_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}}\left(\mathcal{Y}\right)$, which gives a contradictory with the fact $\mathcal{W},$ $\mathcal{Y}\in \mathfrak{F} _{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. Therefore, $\mathcal{W}\cup \mathcal{Y}\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. Now, for any $\mathcal{W},$ $\mathcal{Y}\in \mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, if $\mathcal{W}\cap \mathcal{Y}\subseteq \mathcal{V}$ then by using the fact $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(M\right) \right) = \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(M\right),$ we get $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right) \right) = \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right).$ This implies that $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right) \in \mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ for any $\mathcal{W},$ $\mathcal{Y}\in \mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Thus, $\left(\mathfrak{F}_{_{fix}}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is lattice. □

The above theorem shows that the $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$- set having the relation of set inclusion is a POS and for any two members of the $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$- set, the lub is the join of these two members, while the glb is the lower approximation of the intersection of these two members. Actually, $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \wedge, \vee \right)$ is defined from the view point of algebra and $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is defined from the viewpoint of partially ordered set. Further, $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \wedge, \vee \right)$ and $\left(\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ are both lattices.

Remark 3.1. In above Proposition, we have seen that $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is a lattice such that the sets U and $\emptyset$ are respectively, the greatest and least of $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$. But we know a lattice having least and greatest elements is bounded. Therefore, $\left(\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is a lattice which is bounded.

Therefore, in the assertion that follows, we shall demonstrate that any $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $\mathbb{C} _{_{\mathcal{V}}}$ is also a Join $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $\mathbb{C} _{_{\mathcal{V}}}$, and any $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element of $\mathbb{C} _{_{\mathcal{V}}}$ is a Join $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element of $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$.

Proposition 3.4. Let $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right) \ $be a CSV-Graph and $Q = \left(\mathcal{V}, \mathfrak{C}_{\mathcal{V}}\right)$, be a SVCAS such that $\delta \left(\sigma _{i}\right) \in \mathbb{C} _{_{\mathcal{V}}}.$ Then,

(i) the set $\delta \left(\sigma _{i}\right)$ is a $Join$ $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right),$ if $\delta \left(\sigma _{i}\right)$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $\mathbb{C} _{_{\mathcal{V}}}.$

(ii) the set $\delta \left(\sigma _{i}\right)$ is Join $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element of $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right),$ if $\delta \left(\sigma _{i}\right)$ is a Join $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element of $\mathbb{C} _{_{\mathcal{V}}}$ for parameters $\sigma _{i}.$

Proof. Since for any parameter $\sigma _{i}\in \mathfrak{Q}$ and $\mathfrak{\delta } \left(\sigma _{i}\right) \in \mathbb{C} _{_{\mathcal{V}}}$, $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathfrak{\delta }\left(\sigma _{i}\right) \right) = \mathfrak{\delta }\left(\sigma _{i}\right).$ This shows $\mathfrak{\delta }\left(\sigma _{i}\right) \in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ as $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \{$ $\mathcal{W}\in P\left(\mathcal{V}\right) : \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right) = \mathcal{W}\}.$

$({\rm{i}})$ Suppose there are elements $\mathcal{Y},$ Z in $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ such that $\mathfrak{\delta }\left(\sigma _{i}\right) = \mathcal{Y}\cup Z,$ then there exists some elements $\mathfrak{ \delta }\left(\sigma _{j}\right), \left(j\in I\right)$ and $\mathfrak{ \delta }\left(\sigma _{k}\right), \left(k\in K\right)$ in $\mathbb{C} _{_{\mathcal{V}}}$ such that $\mathfrak{\delta }\left(\sigma _{j}\right) \subseteq \mathcal{Y}$, $\mathfrak{\delta }\left(\sigma _{k}\right) \subseteq Z$ and

Therefore, $\mathfrak{\delta }\left(\sigma _{i}\right) = \left(\bigcup \limits_{_{\mathfrak{\delta }\left(\sigma _{j}\right) \subseteq \mathcal{Y}\text{ }\left(j\in I\right) }}\mathfrak{\delta }\left(\sigma _{j}\right) \right) \cup \left(\bigcup \limits_{\mathfrak{\delta }\left(\sigma _{k}\right) \subseteq Z\text{ }\left(k\in K\right) }\mathfrak{\delta }\left(\sigma _{k}\right) \right).$ Since $\mathfrak{\delta }\left(\sigma _{i}\right)$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $\mathbb{C} _{_{\mathcal{V}}}$, so there exists $t\in I\cup K$ so that $\mathfrak{\delta }\left(\sigma _{i}\right) = \mathfrak{\delta }\left(\sigma _{t}\right).$ But $\mathfrak{\delta }\left(\sigma _{i}\right) = \mathcal{Y}\cup Z$ implies $\mathcal{Y}\subseteq \mathfrak{\delta }\left(\sigma _{i}\right)$ and $Z\subseteq \mathfrak{\delta }\left(\sigma _{i}\right)$. If $\mathfrak{ \delta }\left(\sigma _{t}\right) \subseteq \mathcal{Y},$ then $\mathfrak{ \delta }\left(\sigma _{i}\right) = \mathcal{Y}.$ If $\mathfrak{\delta } \left(\sigma _{t}\right) \subseteq Z$ $\mathfrak{\delta }\left(\sigma _{i}\right) = Z.$ This indicates that $\mathfrak{\delta }\left(\sigma _{i}\right) = \mathcal{Y}$ or $\mathfrak{\delta }\left(\sigma _{i}\right) = Z.$ Thus, $\mathfrak{\delta }\left(\sigma _{i}\right)$ is a Join $\mathcal{ L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Hence, the set $\mathfrak{\delta }\left(\sigma _{i}\right)$ is a $Join$ $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right),$ if $\mathfrak{\delta }\left(\sigma _{i}\right)$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of $\mathbb{C} _{_{\mathcal{V}}}.$

$({\rm{ii}})$ Suppose $\mathfrak{\delta }\left(\sigma _{i}\right)$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element of $\mathbb{C} _{_{\mathcal{V}}}$ for parameters $\sigma _{i}\in \mathfrak{Q.}$ Then there are some elements in $\mathbb{C} _{_{\mathcal{V}}}-\{ \mathfrak{\delta }\left(\sigma _{i}\right) \}$ in such away that $\mathfrak{\delta }\left(\sigma _{i}\right)$ is the union of those elements. In other words, there are some elements $\mathfrak{\delta } \left(\sigma _{j}\right),$ $\left(j\in I\right)$ such that $\mathfrak{ \delta }\left(\sigma _{i}\right) = \bigcup \limits_{j\in I}\mathfrak{\delta } \left(\sigma _{j}\right),$ where $I\subseteq S = \{ \mathfrak{1, 2, ..., } \left \vert \mathbb{C} _{_{\mathcal{V}}}\right \vert \}.$

Since, for any $H\subseteq S$, we have $\mathfrak{\delta }\left(\sigma _{k}\right) _{_{_{(k\in H)}}}\subseteq \bigcup \limits_{j\in H}\mathfrak{\delta }\left(\sigma _{j}\right).$ Then,

Therefore, for any K, T $\subseteq$ I,

and

Hence, we have $\bigcup \limits_{k\in K}\mathfrak{\delta }\left(\sigma _{k}\right) \in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ and $\bigcup \limits_{t\in T}\mathfrak{\delta }\left(\sigma _{t}\right) \in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ As a result, $K_{_{1}}$ and $T_{_{1}}\subseteq I$ exists such that $\bigcup \limits_{j\in I}\mathfrak{\delta }\left(\sigma _{j}\right) = \mathfrak{\delta }\left(\sigma _{i}\right) = \left(\bigcup \limits_{k\in K_{_{1}}}\mathfrak{\delta }\left(\sigma _{k}\right) \right) \cup = \left(\bigcup \limits_{t\in T_{_{1}}}\mathfrak{\delta }\left(\sigma _{t}\right) \right).$ This shows that $\mathfrak{\delta }\left(\sigma _{i}\right)$ is a Join $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element for $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Thus, the set $\mathfrak{\delta }\left(\sigma _{i}\right)$ is a Join $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element of $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right),$ if $\mathfrak{\delta }\left(\sigma _{i}\right)$ is a $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}red$ element of $\mathbb{C} _{_{\mathcal{V}}}$ for parameters $\sigma _{i}$. □

Proposition 3.5. Let $Q = \left(\mathcal{V}, \mathfrak{C}_{ \mathcal{V}}\right)$, be a SVCAS of CSV-Graph $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right)$. Then, for any $r\in V,$ $N_{_{\mathfrak{B}}}(r)$ is a Join $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of the lattice $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right).$

Proof. Suppose $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is a lattice and there exist $\mathcal{W}, \mathcal{Y}\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ such that $N_{_{\mathfrak{B}}}(r) =$ $\mathcal{W} \cup \mathcal{Y}$. Since $r\in N(r)$, $r\in$ $\mathcal{W}\cup \mathcal{Y}$. Therefore, $r\in$ $\mathcal{W}$ or $r\in \mathcal{Y}.$ Furthermore, as $\mathcal{W}, \mathcal{Y}\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, then $N_{_{\mathfrak{B}}}(r)\subseteq$ $\mathcal{W}\subseteq$ $\mathcal{W}\cup \mathcal{Y} = N_{_{\mathfrak{B}}}(r)$ or $N_{_{\mathfrak{B}}}(r)\subseteq \mathcal{Y}\subseteq$ $\mathcal{W}\cup \mathcal{Y} = N_{_{\mathfrak{B}}}(r)$ Therefore, $N_{_{\mathfrak{B}}}(r)$ $=$ $\mathcal{W}$ or $N_{_{\mathfrak{B}}}(r) = \mathcal{Y}$. Thus $N_{_{\mathfrak{B} }}(r)$ is a Join $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ element of the lattice $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right),$ for every $r\in \mathcal{V}$. □

We have already shown that the set $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is a lattice if and only if $W\vee Y =$ $W\cup Y$ and $W\wedge Y = \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right)$. Now in the following we show that $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right),$ is a complete lattice.

Proposition 3.6. Let $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right) \ $be a $\mathcal{CSV}$-$G$raph and $Q = \left(\mathcal{V}, \mathfrak{C}_{\mathcal{V}}\right)$, be a $\mathcal{SVCAS}$. Then, the lattice $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is complete.

Proof. For any $\mathcal{G}\subseteq \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, we need to prove that $\wedge \mathcal{G}$ $\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ and $\vee \mathcal{G}$ $\in$ $\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. Equivalently, we have to prove that $\underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\cap \mathcal{G}\right) \in$ $\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ and $\cup \mathcal{G}$ $\in$ $\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Since $\mathcal{G}\subseteq \mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ then $\cap \mathcal{G\subseteq V}$. According to the fact that $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\cap \mathcal{G}\right) \right) = \underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\cap \mathcal{G}\right),$ that is, $\underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\cap \mathcal{G}\right) \in \mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ If $\cup \mathcal{G}\notin \mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ then there exists $t\in \cup \mathcal{G}$ such that $\mathfrak{\delta }\left(\sigma _{i}\right) \varsubsetneq \cup \mathcal{G}$, for any $\mathfrak{\delta }\left(\sigma _{i}\right) \in \mathbb{C} _{_{\mathcal{V}}}$ and $t\in \mathfrak{\delta }\left(\sigma _{i}\right)$. Hence, there exists an element $\mathcal{W}$ in $\mathcal{G}$ so that $t\in$ $\mathcal{W}$ and $\mathfrak{\delta }\left(\sigma _{i}\right) \varsubsetneq$ $\mathcal{W}$, for any $\mathfrak{\delta }\left(\sigma _{i}\right) \in \mathbb{C} _{_{\mathcal{V}}}$ and $t\in \mathfrak{\delta }\left(\sigma _{i}\right).$ So, $t\notin \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right)$ that is, $\mathcal{W}\notin \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Which is contradictory with the fact that $\mathcal{W}\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. Hence $\cup \mathcal{G}$ $\in$ $\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Therefore, $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is a complete lattice. □

Note that the $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$-set induced by $\mathbb{C} _{_{\mathcal{V}}}$ need not be always a distributive lattice. The example that follows will support our assertion.

Example 3.5. Suppose we have a $\mathcal{CSV}$-$G$raph $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right) \ $such that $Q = \left(\mathcal{V}, \mathfrak{C}_{\mathcal{V}}\right)$, is a $\mathcal{SVCAS}$ where $V = \left\{ x_{1}, x_{2}, x_{3}, x_{4}\right\}$ is a vertex set and $R = \left\{ \sigma _{\mathfrak{1}}, \sigma _{\mathfrak{2}}, \sigma _{\mathfrak{3} }\right\}$, set representing all parameters $\sigma _{\mathfrak{1}}, \sigma _{\mathfrak{2}}, \sigma _{\mathfrak{3}}, \sigma _{\mathfrak{4}}$ as shown in Table 5, with $\delta \left(\sigma _{\mathfrak{1}}\right) = \left\{ x_{1}, x_{2}\right\},$ $\delta \left(\sigma _{\mathfrak{2}}\right) = \left\{ x_{2}, x_{3}\right\}, \ \delta \left(\sigma _{\mathfrak{3}}\right) = \left\{ x_{1}, x_{3}, x_{4}\right\}.$ Also, $\mathbb{C} _{_{\mathcal{V}}} = \{\delta \left(\sigma _{\mathfrak{1}}\right), \delta \left(\sigma _{\mathfrak{2}}\right), \delta \left(\sigma _{\mathfrak{3} }\right) \} = \{\left\{ x_{1}, x_{2}\right\}, \left\{ x_{2}, x_{3}\right\}, \left\{ x_{1}, x_{3}, x_{4}\right\} \}$.

Then, by using the expression $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \{$ $W\in P\left(\mathcal{V}\right) :\underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right) = W\},$ we obtain $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \{\emptyset,$ $\left\{ x_{1}, x_{2}\right\}, \left\{ x_{1}, x_{2}, x_{3}\right\}, \left\{ x_{2}, x_{3}\right\}, \left\{ x_{1}, x_{3}, x_{4}\right\}, V\}.$ Also, $\left\{ x_{1}, x_{2}, x_{3}\right\} \wedge \left(\left\{ x_{1}, x_{3}, x_{4}\right\} \vee \left\{ x_{1}, x_{2}\right\} \right) = \left\{ x_{1}, x_{2}, x_{3}\right\},$ but $\left(\left\{ x_{1}, x_{3}, x_{4}\right\} \wedge \left\{ x_{1}, x_{2}, x_{3}\right\} \right) \vee \left(\left\{ x_{1}, x_{2}, x_{3}\right\} \wedge \left\{ x_{1}, x_{2}\right\} \right) = \left\{ x_{1}, x_{2}\right\}.$ Which shows that $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right) = \{\emptyset,$ $\left\{ x_{1}, x_{2}\right\}, \left\{ x_{2}, x_{3}\right\}, \left\{ x_{1}, x_{3}, x_{4}\right\}, \left\{ x_{1}, x_{2}, x_{3}\right\}, V\}$ is not a distributive lattice. In other words, $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$- set, that is not distributive.

In the statement that follows, we investigate the requirement for the $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ set to transform into a distributive lattice.

Proposition 3.7. Let $\Theta \ $be a $\mathcal{CSV}$-Graph and $Q = \left(\mathcal{V}, \mathfrak{C}_{\mathcal{V}}\right)$, be a $\mathcal{SVCAS}$. If $\mathbb{C} _{_{\mathcal{V}}}$ is soft unary, then $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right), \subseteq \right)$ is a distributive lattice.

Proof. Suppose $\mathcal{W},$ $\mathcal{Y}$ and $\mathcal{Z}\in \mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ where $\mathcal{W},$ $\mathcal{Y},$ $Z\subseteq \mathcal{V}$. then for parameters $\sigma _{i},$ $\sigma _{j},$ $\sigma _{k}$ there are some elements $\mathfrak{\delta }\left(\sigma _{i}\right),$ $\left(i\in I\right)$, $\mathfrak{\delta }\left(\sigma _{j}\right), \left(j\in I\right)$ and $\mathfrak{\delta }\left(\sigma _{k}\right), \left(k\in K\right)$ in $\mathbb{C} _{_{\mathcal{V}}}$ such that $\mathfrak{\delta }\left(\sigma _{i}\right) \subseteq \mathcal{W}$, $\mathfrak{\delta }\left(\sigma _{j}\right) \subseteq \mathcal{Y}$, $\mathfrak{\delta }\left(\sigma _{k}\right) \subseteq Z$ with

where I, J, K $\subseteq$$\{ \mathfrak{1, 2, ..., } \left \vert \mathbb{C} _{_{\mathcal{V}}}\right \vert \}$.

It can easily be seen that

Moreover,

Since, $\mathbb{C} _{_{\mathcal{V}}}$ is unary, then for every $x\in \mathcal{V}$, $\left \vert \text{Mdes}_{\mathcal{T}}\left(x\right) \right \vert = 1$. We suppose, Mdes$_{ \mathcal{T}}\left(x\right) = \{ \mathfrak{\delta }\left(\sigma _{x}\right) \}$ for any $x\in \mathcal{V}$. Then, $\mathfrak{\delta }\left(\sigma _{i}\right) \cap \mathfrak{\delta }\left(\sigma _{j}\right)$ is the union of finite elements in $\mathbb{C} _{_{\mathcal{V}}}.$ Hence$,$

□

Hence, $\mathcal{F}_{fix}$($\mathbb{C} _{_{\mathcal{V}}}$) is a distributive lattice.

Proposition 3.8. Let $Q = \left(\mathcal{V}, \mathfrak{C}_{ \mathcal{V}}\right)$, be a $\mathcal{SVCAS}$ such that $\mathbb{C} _{_{\mathcal{V}}}$ is soft unary. Then, $P\cap$ $Q$ $\in F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right),$ for any P, Q $\in F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$

Proof. Let p $\in \mathcal{P}\cap$ $\mathcal{Q}$ then $p\in \mathcal{P}$ and $p\in$ $\mathcal{Q}$. Since, $\mathbb{C} _{_{\mathcal{V}}}$ is soft unary so, for every $x\in \mathcal{V}$, $\left \vert \text{Mdes}_{\mathcal{T}}\left(x\right) \right \vert = 1.$ We suppose, Mdes$_{\mathcal{T}}\left(x\right) = \{ \mathfrak{\delta }\left(\sigma _{x}\right) \}$ for any $x\in \mathcal{V}$. As, $\mathcal{P},$ $\mathcal{Q}$ $\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right),$ then $\mathfrak{\delta }\left(\sigma _{y}\right) \subseteq \mathcal{P}$ and $\mathfrak{\delta }\left(\sigma _{y}\right) \subseteq$$\mathcal{Q}$, that is, $\mathfrak{\delta }\left(\sigma _{y}\right) \subseteq \mathcal{P}\cap$$\mathcal{Q}$. therefore,

showing that $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}(\mathcal{P}\cap \mathcal{Q}) = \mathcal{P} \cap \mathcal{Q}.$

Thus, $\mathcal{P}\cap$$\mathcal{Q}$$\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, that is, an intersection of any two members of $\left(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right) \right)$ $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ set induced by $\mathbb{C} _{_{\mathcal{V}}}$, a soft unary covering, is closed. □

4.   Algebraic Structures related to$\mathcal{L}\mathfrak{i}$-Soft Rough Covering Graphs

In this section, we will prove $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ set, with respect to a soft unary covering $\mathbb{C} _{_{\mathcal{V}}}$ over the vertex set $V$ is a $pseud^{Cd}$ lattice and a D- $pseud^{Cd}$ lattice. It means any element of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ set has both a pseudocomplement and a D- pseudocomplement. Also, we will see that for any member of $\mathcal{L}\mathfrak{i}$-$SRCFP$ set, its $pseud^{Cmt}($pseudocomplement) represents the $SLA$ of its complement and D- $pseud^{Cmt}$ represents the union of all $J$oin $\mathcal{L}\mathfrak{i}$-$\mathcal{SU}irred$ elements containing the element in its complement. We also discuss some algebras connected with $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ sets.

Proposition 4.1. Let $T = \left(\mathcal{V}\mathit{\text{, }} \mathbb{C} _{_{\mathcal{V}}}\right)$ be a $\mathcal{SCAS}$ such that $\mathbb{C} _{_{\mathcal{V}}}$ is soft unary$.$ Then,

$\left(i\right)$ $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a $pseud^{Cd}$ lattice such that $W^{\ast } = \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right),$ where $W\in$ $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$;

$\left(ii\right)$ $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a D- $pseud^{Cd}$ lattice, and $W^{+} = \bigcup\limits_{x\in \sim \mathcal{W}\left(x\in \mathfrak{\delta } \left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\delta \left(\sigma _{i}\right),$ for any $W\in$ $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, parameter $\left(\sigma _{i}\right) \in Q,$ where $\sim$ $W$ is the complement of $W$ in $V$ and $J(F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))$ denotes all $Join$ $Li$-$SUirred$ elements in $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$

Proof. $\left(i\right)$ Suppose $\mathcal{W}\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, then we have $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) \right) = \underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right)$, showing that $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) \in \mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ But $\left(\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) \right) \subseteq \left(\sim \mathcal{W}\right),$ so $\mathcal{W}\cap \left(\underline{\mathcal{F}} _{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) \right) = \emptyset$. Therefore, $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \left(\underline{\mathcal{F}} _{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) \right) \right) = \emptyset.$ Now it is needed to prove that $\mathcal{Y}\subseteq \left(\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) \right)$ if $\underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right) = \emptyset$ for any $\mathcal{Y}\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, $\mathcal{W}\cap \mathcal{Y\in F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ for $\mathcal{W}$, $\mathcal{Y\in F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Hence, $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right) = \left(\mathcal{W}\cap \mathcal{Y}\right).$ Further, if $\underline{\mathcal{F}} _{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right) = \emptyset$ then $\mathcal{W}\cap \mathcal{Y} = \emptyset.$ Therefore, for any $\mathcal{Y }\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ if $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\cap \mathcal{Y}\right) = \left(\mathcal{W}\cap \mathcal{Y}\right)$ then $\left(\mathcal{W}\cap \mathcal{Y} \right) = \emptyset.$ As $\left(\mathcal{W}\cap \mathcal{Y}\right) = \emptyset$ so $\mathcal{Y}\subseteq \left(\sim \mathcal{W}\right).$ Which shows $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{Y}\right) \subseteq \left(\underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) \right).$ But $\mathcal{ Y\in F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ gives $\mathcal{Y = }\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{Y}\right)$ and so $\mathcal{Y = } \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{Y}\right) \subseteq \left(\underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) \right)$. Thus, $\mathcal{W}^{\ast } =$ $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right)$ for any $\mathcal{W}\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. That is, $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a $pseud^{Cd}$ lattice.

$\left(ii\right)$ For any $\mathcal{W}\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$,

So,

Further it is easy to show that $\mathcal{W\cup }\left(\bigcup \limits_{x\in \sim \mathcal{W}\left(x\in \mathfrak{\delta }\left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right) \right) = \mathcal{V}$. now we need only to show that for any

The following two cases serve as evidence for it.

$Case$ $1:$ If $\bigcup \limits_{x\in \sim \mathcal{W}\left(x\in \mathfrak{ \delta }\left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right) = \sim$ $\mathcal{W}$, then $\bigcup \limits_{x\in \sim \mathcal{ W}\left(x\in \mathfrak{\delta }\left(\sigma _{i}\right) \in J(\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right)$ $\subseteq \mathcal{Y}$.

$Case$ $2:$ If $\sim$ $\mathcal{W\subset }\bigcup \limits_{x\in \sim \mathcal{W}\left(x\in \mathfrak{\delta }\left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right)$, then $\sim$ $\mathcal{W\subset Y}$. If $\sim$ $\mathcal{W = Y}$, then $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) = \underline{\mathcal{F}} _{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{Y}\right) = \mathcal{Y = }\sim$ $\mathcal{W }$. Since,

which is contradictory with $\sim \mathcal{W\subset }\bigcup \limits_{x\in \sim \mathcal{W}\left(x\in \mathfrak{\delta }\left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right).$

Suppose $\mathcal{Y\subset }\bigcup \limits_{x\in \sim \mathcal{W}\left(x\in \mathfrak{\delta }\left(\sigma _{i}\right) \in J(\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right)$, then there will exist $y\in \bigcup \limits_{x\in \sim \mathcal{W}\left(x\in \mathfrak{\delta }\left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right)$ such that $y\notin \mathcal{Y}$. So, $y\notin \sim$ $\mathcal{ W}$ showing that there exists $z\in \sim$ $\mathcal{W}$ such that $y\in \mathfrak{\delta }\left(\sigma _{i}\right)$ for any $\mathfrak{\delta } \left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ and $z\in \mathfrak{\delta }\left(\sigma _{i}\right).$ Since, $\sim$ $\mathcal{W}$ is properly contained in$\mathcal{\ Y}$ and $z\in \mathcal{Y}$, so, $\mathfrak{\delta }\left(\sigma _{i}\right) \varsubsetneq \mathcal{Y}$ for any $\mathfrak{\delta }\left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))$ and $z\in \mathfrak{\delta }\left(\sigma _{i}\right).$ That is, $z\notin \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{Y}\right)$. Equivalently, we can say that $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{Y}\right) \neq \mathcal{Y}$, which is a contradiction to the fact that $\mathcal{Y}\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. Hence, $\bigcup \limits_{x\in \sim \mathcal{W} \left(x\in \mathfrak{\delta }\left(\sigma _{i}\right) \in J(\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right) \subseteq \mathcal{Y}$. As a Consequence, $\mathcal{W} ^{+} = \bigcup \limits_{x\in \sim \mathcal{W}\left(x\in \mathfrak{\delta } \left(\sigma _{i}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right))\right) }\mathfrak{\delta }\left(\sigma _{i}\right)$ for any $\mathcal{W}\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, that is, $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a D- $pseud^{Cd}$ lattice. Thus, we have seen that $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$- set induced by any soft unary covering $\mathbb{C} _{_{\mathcal{V}}}$ over $\mathcal{V}$ represents a $pseud^{Cd}$ lattice and also a D- $pseud^{Cd}$ lattice. This shows that $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a double $p$-algebra. □

Remark 4.1. In general, no soft unary covering by the $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ set will generate a Stone algebra or a dual Stone algebra.

Example 4.1. Let $\Theta = \left(\Omega, \mathfrak{\delta }, \mathfrak{\gamma }, \mathfrak{R}\right) \ $represents a $\mathcal{CSV}$-$G$raph and $Q = \left(\mathcal{V}, \mathfrak{C}_{\mathcal{V}}\right)$, be a $\mathcal{SVCAS}$, where $V = \left\{ x_{1}, x_{2}, x_{3}, x_{4}\right\}$ is a vertex set and $R = \left\{ \sigma _{\mathfrak{1}}, \sigma _{\mathfrak{2}}, \sigma _{\mathfrak{3} }, \sigma _{\mathfrak{4}}\right\}$, set representing all parameters $\sigma _{\mathfrak{1}}, \sigma _{\mathfrak{2}}, \sigma _{\mathfrak{3}}, \sigma _{ \mathfrak{4}}$ as shown in Table 6, with $\delta \left(\sigma _{\mathfrak{ 1}}\right) = \left\{ x_{3}\right\},$ $\delta \left(\sigma _{\mathfrak{2} }\right) = \left\{ x_{1}\right\}, \ \delta \left(\sigma _{\mathfrak{3} }\right) = \left\{ x_{1}, x_{3}, x_{4}\right\},$ $\delta \left(\sigma _{ \mathfrak{4}}\right) = \left\{ x_{2}, x_{3}\right\}.$

Let

Then,

Let

Then,

since,

That is, $\mathcal{M}^{\ast }\cup \mathcal{M}^{\ast \ast } \neq \mathcal{V}.$ Therefore, $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is not a Stone algebra.

Also,

showing that

Thus, $\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is not a dual Stone algebra.

The purpose of the following claim is to investigate the circumstances and conditions under which the $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$-set, which is caused by any soft covering, yields a double Stone algebra and a boolean lattice, respectively.

Proposition 4.2. Suppose a $\mathcal{CSV}$-$G$raph is represented by $\Theta \ $having a $\mathcal{SVCAS}$, denoted by $Q = \left(\mathcal{V}, \mathfrak{C}_{\mathcal{ V}}\right).$ If $Li$-$S_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a partition of $V$, then $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ represents a boolean lattice.

Proof. We need first to show that if$\mathcal{L}\mathfrak{i}$-$\mathcal{S} _{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a partition, then $\mathbb{C} _{_{\mathcal{V}}}$ is a soft unary covering. We assume on contrary that $\mathbb{C} _{_{\mathcal{V}}}$ is not soft unary covering. Therefore, there will be an element $x\in \mathcal{V}$ such that $\left \vert \text{Mdes}_{\mathcal{T} }\left(x\right) \right \vert \gvertneqq 1.$ So, we have parameters $\sigma _{_{1}},$ $\sigma _{_{2}}\in \mathfrak{R}$ with $\mathfrak{\delta }\left(\sigma _{_{1}}\right)$, $\mathfrak{\delta }\left(\sigma _{2}\right) \in \mathcal{L}\mathfrak{i}$-$\mathcal{S}_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ so that $\mathfrak{\delta }\left(\sigma _{_{1}}\right)$, $\mathfrak{\delta }\left(\sigma _{2}\right) \in$ Mdes$_{ \mathcal{T}}\left(x\right),$ that is, $x\in \mathfrak{\delta }\left(\sigma _{_{1}}\right) \cap \mathfrak{\delta }\left(\sigma _{2}\right),$ which is contradictory with the fact that $\mathcal{L}\mathfrak{i}$-$\mathcal{S}_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a partition of $\mathcal{V}.$ Therefore, one can see that $\mathbb{C} _{_{\mathcal{V}}}$ is a soft unary covering. But, $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is distributive lattice. Moreover, $\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ represents a bounded lattice. Now, we will have to show only that $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a lattice which is complemented. Equivalently, we have to prove that $\sim$ $\mathcal{W}\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ for any $\mathcal{W}\in$ $\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$. If we assume that $\sim$ $\mathcal{W}$ $\notin$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, then there is an element $y$ in $\sim$ $\mathcal{W}$ such that for $\sigma _{i}\in \mathfrak{R, }$ $\mathfrak{\delta } \left(\sigma _{i}\right) \varsubsetneq \sim$ $\mathcal{W}$. Since, $\mathbb{C} _{_{\mathcal{V}}}$ is soft unary then for every vertex $x\in \mathcal{V}$ we have $Mdes_{\mathcal{T}}\left(x\right) = \{ \mathfrak{\delta }\left(\sigma _{x}\right) \}$. So, $\mathfrak{\delta }\left(\sigma _{y}\right) \varsubsetneq$ $\sim$ $\mathcal{W}$. As a result, there is $x\in$ $\mathcal{W}$ such that $x\in \mathfrak{\delta }\left(\sigma _{y}\right)$ exists$.$ But it is given $\mathcal{L}\mathfrak{i}$-$\mathcal{S} _{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is partitioning the universe $\mathcal{V}$, so we have $\mathfrak{\delta }\left(\sigma _{y}\right) = \mathfrak{\delta }\left(\sigma _{x}\right).$ Thus, $\mathfrak{\delta }\left(\sigma _{x}\right) \varsubsetneq \mathcal{W}$, i.e, $x\notin \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right)$. In other words, $\underline{ \mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right) \neq \mathcal{W}$, which is contradictory with $\mathcal{W}\in$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Therefore, $\sim$ $\mathcal{W}\in$ $\mathcal{F} _{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, showing that $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a complemented lattice. Hence, as a consequence, $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a boolean lattice. □

Proposition 4.3. Suppose a $\mathcal{CSV}$-$G$raph is represented by $\Theta \ $having a $\mathcal{SVCAS}$, denoted by $Q = \left(\mathcal{V}, \mathfrak{C} _{\mathcal{V}}\right)$. If $Li$-$S_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ partitioning the vertex set $V$, then $F_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a double Stone algebra.

Proof. For any $\mathcal{W}\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$, we prove $\mathcal{W}^{\ast } = \sim$ $\mathcal{W} =$ $\mathcal{W}^{+}$. We know that $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is a boolean lattice, therefore $\sim \mathcal{W} \in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ that is, $\underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) = \sim \mathcal{W}$. So, $\mathcal{W}^{\ast } = \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\sim \mathcal{W}\right) = \sim$ $\mathcal{W}$. For any $y\in \sim$ $\mathcal{W}$, if $\mathfrak{\delta }\left(\sigma _{y}\right) \in Mdes_{\mathcal{T}}\left(y\right),$ then $\mathfrak{\delta } \left(\sigma _{y}\right)$ is a $Join$ $\mathcal{L}\mathfrak{i}$-$\mathcal{ SU}red$ element of $\mathbb{C} _{_{\mathcal{V}}}.$ Using Proposition 4.1, $\mathfrak{\delta } \left(\sigma _{y}\right) \in J(\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)).$ Assume that $x\in$ $\mathcal{W}$ exists such that $x\in$ $\mathfrak{\delta }\left(\sigma _{y}\right)$. Since $\mathcal{ L}\mathfrak{i}$-$\mathcal{S}_{redct}\left(\mathbb{C} _{_{\mathcal{V}}}\right),$ being a partition of V, leads to the fact that $\mathfrak{\delta }\left(\sigma _{y}\right) \in Mdes_{\mathcal{T}}\left(x\right)$. In the light of this, we conclude that, $\mathfrak{\delta } \left(\sigma _{y}\right) \varsubsetneq \mathcal{W}$, that is, $x\notin \underline{\mathcal{F}}_{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right)$. So, $\underline{\mathcal{F}} _{_{_{ \mathbb{C} _{_{\mathcal{V}}}}}}\left(\mathcal{W}\right) \neq \mathcal{W}$ or $\mathcal{ W\notin }$ $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Which is a contradiction because $\mathcal{W}\in \mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right).$ Therefore,

Similarly, it is easy to prove that $\mathcal{W}^{\ast \ast } = \sim \sim \mathcal{W} = \mathcal{W} = \mathcal{W}^{++}.$ Therefore, $\mathcal{W}^{\ast }\cup$ $\mathcal{W}^{\ast \ast } = \mathcal{V},$ $\mathcal{W}^{+}\cap$ $\mathcal{W}^{++} = \emptyset$, demonstrating that $\mathcal{F}_{fix}\left(\mathbb{C} _{_{\mathcal{V}}}\right)$ is both a dual Stone algebra and a Stone algebra. □

5.   Conclusions and future works

Soft set theory and rough set theory are two newer tools to discuss uncertainty. Soft graph theory is a nice way to depict certain information. In order to discuss uncertainty in soft graphs, a possible amalgamation of three different concepts, that is, rough sets, soft sets and graphs is discussed. In this paper, we have introduced two new concepts $\mathcal{L}\mathfrak{i}$-soft rough covering graphs ($\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s) and the concept of fixed point sets, called $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ set, induced by soft covering $\mathbb{C} _{_{\mathcal{V}}}$ of such graphs.$\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s are used to discuss various kinds of approximation operators and the properties associated with them. We review the conditions for the family of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ sets to become a lattice structure, distributive lattice and complete lattice. It is shown that the $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCFP}$ set is both a double Stone algebra and a boolean lattice. Furthermore, we looked into some algebras that dealt with the fixed points of $\mathcal{L}\mathfrak{i}$-$\mathcal{SRCG}$s. Applications of the algebraic structures available in covering soft sets to soft graphs may reveal new facets of graph theory. This work shows a novel approach for dealing with fixed points based on soft rough covering graphs. The future work will be focused on

$\left(i\right)$ constructing the fixed points sets based on some other kind of soft rough graphs;

$\left(ii\right)$ constructing the fixed points sets based on multi-granular soft rough covering sets;

$\left(iii\right)$ constructing the fixed points sets based on upper approximation operators;

$\left(iv\right)$ comparison between the proposed study and the study to be used in $\left(iii\right)$; $

$\left(v\right)$ developing the family of $\mathcal{SRCFP}$ $sets$ based on soft neighborhood (of elements of universe set) and studying the conditions that these sets become some lattice structure. Further, some algebra can be discussed related to $\mathcal{SRCFP}$ $sets$ based on soft neighborhoods.

Use of AI tools declaration

The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

The authors acknowledge the financial support provided by the Center of Excellence in Theoretical and Computational Science (TaCS-CoE), KMUTT.

This research was funded by National Science, Research and Innovation Fund (NSRF), and King Mongkut's University of Technology North Bangkok with Contract no. KMUTNB-FF-66-05.

Conflict of interest

The authors declare that they do not have any competing interests.