Roughness in Cayley graphs

In this paper, rough approximations of Cayley graphs are studied, and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition for pseudo-Cayley graphs containing Cayley graphs is proposed, and a rough approximation is expanded to pseudo-Cayley graphs. In addition, rough vert...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences 2010-09, Vol.180 (17), p.3362-3372
Main Authors: Shahzamanian, M.H., Shirmohammadi, M., Davvaz, B.
Format: Article
Language:English
Subjects:
Algebra
Approximation
Cayley graph
Graphs
Group
Lower and upper approximation
Networks
Normal subgroup
Optimization
Pseudo-Cayley graph
Rough set
Roughness
Theorems
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, rough approximations of Cayley graphs are studied, and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition for pseudo-Cayley graphs containing Cayley graphs is proposed, and a rough approximation is expanded to pseudo-Cayley graphs. In addition, rough vertex pseudo-Cayley graphs and rough pseudo-Cayley graphs are introduced. Some theorems are provided from which properties such as connectivity and optimal connectivity are derived. This approach opens new research fields, such as data networks.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2010.05.011