pith. sign in

arxiv: 1203.2432 · v1 · pith:OCKHFAF3new · submitted 2012-03-12 · 🧮 math.GR

Roughness in Cayley Graphs

classification 🧮 math.GR
keywords graphsroughcayleypseudo-cayleyconnectivityintroducedsomealgebraic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.