Roughness in Cayley graphs
From MaRDI portal
Publication:991887
DOI10.1016/J.INS.2010.05.011zbMATH Open1231.05125arXiv1203.2432OpenAlexW1997986760MaRDI QIDQ991887FDOQ991887
Publication date: 8 September 2010
Published in: Information Sciences (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1203.2432
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rough sets
- Rudiments of rough sets
- Relational interpretations of neighborhood operators and rough set approximation operators
- Two new operators in rough set theory with applications to fuzzy sets
- Generalized rough sets based on relations
- Roughness bounds in rough set operations
- Topological approaches to covering rough sets
- An axiomatic characterization of a fuzzy generalization of rough sets.
- Neighborhood operator systems and approximations
- On the structure of generalized rough sets
- Approximations in \(H_v\)-modules.
- Rough approximations on a complete completely distributive lattice with applications to generalized rough sets
- On definable concepts of rough set models
- Rough ideals in semigroups
- The lower and upper approximations in a fuzzy group
- On the structure of rough prime (primary) ideals and rough fuzzy prime (primary) ideals in commutative rings.
- Rough prime ideals and rough fuzzy prime ideals in semigroups.
- Roughness in rings.
- Roughness in modules.
- A new view of the approximations in \(H_v\)-groups.
- Roughness based on fuzzy ideals
- The lower and upper approximations in a quotient hypermodule with respect to fuzzy sets.
- A short note on algebraic \(T\)-rough sets
- Roughness in \(n\)-ary hypergroups.
- Minimization of axiom sets on fuzzy approximation operators
- A novel approach to fuzzy rough sets based on a fuzzy covering
- (\(\vartheta, T\))-fuzzy rough approximation operators and the \(TL\)-fuzzy rough ideals on a ring
- Connectivity of minimal Cayley graphs
- ROUGHNESS OF GAMMA-SUBSEMIGROUPS/IDEALS IN GAMMA-SEMIGROUPS
- Rough approximations in a general approximation space and their fundamental properties
Cited In (13)
- On rough set and fuzzy sublattice
- Clique Number and Girth of the Rough Ideal-Based Rough Edge Cayley Graph
- Roughness and fuzziness in quantales.
- Roughness in $G$-graphs
- On A Rough Cayley Graph Related to Conjugacy Classes
- Application of near approximations in Cayley graphs
- Rough sets on graphs: New dependency and accuracy measures
- Rough set theory applied to lattice theory
- Title not available (Why is that?)
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
- An application of rough sets to graph theory
- Generalized Cayley graphs over polygroups
- A novel connection between rough sets, hypergraphs and hypergroups
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)
