Orientable embedding of Cayley graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orientable Embedding of Cayley Graphs by William Gustin

Thus any (standard) regenerative event can be represented by a Markov process on a continuous state space. It follows, for example, that the fact that poo(t) is almost everywhere differentiate is a consequence of the regenerative property of the state 0, but the deeper result that poo(t) is everywhere differentiate requires also the discrete nature of the state space. It is possible to extend t...

متن کامل

Fault Tolerant Ring Embedding in tetravalent Cayley Network Graphs

Our purpose in the present paper is to investigate the structural properties of the newly proposed Cayley networks of constant node degree 4. We show that the graph contains rings of maximal length in presence of multiple faults. Our results provide further evidence to the usefulness and robustness of these network graphs.

متن کامل

Embedding Digraphs on Orientable Surfaces

We consider a notion of embedding digraphs on orientable surfaces, applicable to digraphs in which the indegree equals the outdegree for every vertex, i.e., Eulerian digraphs. This idea has been considered before in the context of “compatible Euler tours” or “orthogonal A-trails” by Andsersen at al [1] and by Bouchet [4]. This prior work has mostly been limited to embeddings of Eulerian digraph...

متن کامل

Cayley graphs - Cayley nets

It is, however, not clear how to choose the generators to produce special graphs. We know many topologies and their generators, but many more may be constructed in the future, having better properties (in terms of diameter, nodal degree and connectivity) than for instance the hypercube. I will present several graphs which connect rings using the generator g 1 and some additional generators.

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1963

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1963-10952-0