Roughness in Cayley graphs

被引：31

作者：

Shahzamanian, M. H. ^{[1
]}

Shirmohammadi, M. ^{[2
]}

Davvaz, B. ^{[1
]}

机构：

[1] Yazd Univ, Dept Math, Yazd, Iran

[2] Yazd Univ, Dept Comp Engn, Yazd, Iran

来源：

INFORMATION SCIENCES | 2010年 / 180卷 / 17期

关键词：

Cayley graph; Rough set; Group; Normal subgroup; Lower and upper approximation; Pseudo-Cayley graph; IDEALS; APPROXIMATIONS; OPERATORS;

D O I：

10.1016/j.ins.2010.05.011

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. (C) 2010 Elsevier Inc. All rights reserved.

引用

页码：3362 / 3372

页数：11

共 40 条

[1]

Biswas R., 1994, Bulletin of the Polish Academy of Sciences Mathematics, V42, P251

[2]

Bondy J. A., 1976, Graph theory with applications

[3]

CACCETTA L, 1986, ARS COMBINATORIA, V23, P21

[4] A short note on algebraic T-rough sets [J].