Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ins.2010.05.011 | Inf. Sci. |
Keywords | Field | DocType |
rough vertex pseudo-cayley graph,cayley graph,pseudo-cayley graph,rough pseudo-cayley graph,new research field,data network,rough approximation,rough edge cayley graph,optimal connectivity,new algebraic definition,normal subgroup,group,rough set | Discrete mathematics,Indifference graph,Combinatorics,Vertex-transitive graph,Cayley graph,Cayley transform,Chordal graph,Graph product,Pathwidth,Mathematics,Maximal independent set | Journal |
Volume | Issue | ISSN |
180 | 17 | Inf. Sci. 180, 17 (2010): 3362-3372 |
Citations | PageRank | References |
11 | 0.54 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. H. Shahzamanian | 1 | 11 | 0.54 |
| M. Shirmohammadi | 2 | 11 | 0.54 |
| B. Davvaz | 3 | 795 | 57.79 |