Roughness in Cayley graphs
From MaRDI portal
Publication:991887
Abstract: In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is expanded to pseudo-Cayley graphs. Also, rough vertex pseudo-Cayley graphs and rough pseudo-Cayley graphs are introduced. Some theorems are provided, form which some properties such as connectivity and optimal connectivity are derived. This approach opens a new research field in sciences such as data networks.
Recommendations
Cites work
- scientific article; zbMATH DE number 3991301 (Why is no real title available?)
- scientific article; zbMATH DE number 3706451 (Why is no real title available?)
- scientific article; zbMATH DE number 1910408 (Why is no real title available?)
- scientific article; zbMATH DE number 759602 (Why is no real title available?)
- scientific article; zbMATH DE number 871175 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- (\(\vartheta, T\))-fuzzy rough approximation operators and the \(TL\)-fuzzy rough ideals on a ring
- A new view of the approximations in \(H_v\)-groups.
- A novel approach to fuzzy rough sets based on a fuzzy covering
- A short note on algebraic \(T\)-rough sets
- An axiomatic characterization of a fuzzy generalization of rough sets.
- Approximations in \(H_v\)-modules.
- Connectivity of minimal Cayley graphs
- Generalized rough sets based on relations
- Graph theory
- Minimization of axiom sets on fuzzy approximation operators
- Neighborhood operator systems and approximations
- On definable concepts of rough set models
- On the structure of generalized rough sets
- On the structure of rough prime (primary) ideals and rough fuzzy prime (primary) ideals in commutative rings.
- ROUGHNESS OF GAMMA-SUBSEMIGROUPS/IDEALS IN GAMMA-SEMIGROUPS
- Relational interpretations of neighborhood operators and rough set approximation operators
- Rough approximations in a general approximation space and their fundamental properties
- Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
- Rough ideals in semigroups
- Rough prime ideals and rough fuzzy prime ideals in semigroups.
- Rough sets
- Rough subpolygroups in a factor polygroup.
- Roughness based on fuzzy ideals
- Roughness bounds in rough set operations
- Roughness in \(n\)-ary hypergroups.
- Roughness in modules.
- Roughness in rings.
- Rudiments of rough sets
- The lower and upper approximations in a fuzzy group
- The lower and upper approximations in a quotient hypermodule with respect to fuzzy sets.
- Topological approaches to covering rough sets
- Two new operators in rough set theory with applications to fuzzy sets
Cited in
(16)- Analogues of Cayley graphs for topological groups
- On a rough Cayley graph related to conjugacy classes
- On rough set and fuzzy sublattice
- Clique Number and Girth of the Rough Ideal-Based Rough Edge Cayley Graph
- Roughness in $G$-graphs
- Generalized Cayley graphs over polygroups
- Characteristics of common neighborhood graph under graph operations and on Cayley graphs
- Application of near approximations in Cayley graphs
- An application of rough sets to graph theory
- Cayley vague graphs
- Roughness and fuzziness in quantales.
- E-rough analysis on undirected networks
- Rough set theory applied to lattice theory
- A novel connection between rough sets, hypergraphs and hypergroups
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
- Rough sets on graphs: new dependency and accuracy measures
This page was built for publication: Roughness in Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991887)
