The Degree/Diameter Problem for mixed abelian Cayley graphs
نویسندگان
چکیده
منابع مشابه
A Moore-like bound for mixed abelian Cayley graphs
We give an upper bound for the number of vertices in mixed abelian Cayley graphs with given degree and diameter.
متن کاملNORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
متن کاملSpectral estimates for Abelian Cayley graphs
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d −O(dn−4/d ), where the implied constant is absolute. We estimate the constant in the O(dn−4/d ) notation. We show that for any fixed d, then for a large odd prime, n, theO(dn−4/d ) cannot be improved; more precisely, most d-regular graphs on prime n vertice...
متن کاملThe Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
We address the degree-diameter problem for Cayley graphs of Abelian groups (Abelian graphs), both directed and undirected. The problem turns out to be closely related to the problem of finding efficient lattice coverings of Euclidean space by shapes such as octahedra and tetrahedra; we exploit this relationship in both directions. For 2 generators (dimensions) these methods yield optimal Abelia...
متن کاملThe isomorphism problem for Cayley graphs
The isomorphism problem for Cayley graphs over a group H will be considered and solved completely for cyclic groups H of prime power order for every prime p including p = 2. The method we use to obtain our solution is based on Schur rings. This method can be applied as well to colored Cayley graphs, and its scope admits further generalizations. 1. How to solve the isomorphism problem? In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.04.018