Cayley digraphs with normal adjacency matrices
نویسندگان
چکیده
منابع مشابه
On the Cayley Digraphs That Are Patterns of Unitary Matrices
Study the relationship between unitary matrices and their patterns is motivated by works in quantum chaology (see, e.g., [KS99]) and quantum computation (see, e.g., [M96] and [AKV01]). We prove that if a Cayley digraph is a line digraph then it is the pattern of a unitary matrix. We prove that for any finite group with two generators there exists a set of generators such that the Cayley digraph...
متن کاملLarge Cayley digraphs and bipartite Cayley digraphs of odd diameters
Let Cd,k be the largest number of vertices in a Cayley digraph of degree d and diameter k, and let BCd,k be the largest order of a bipartite Cayley digraph for given d and k. For every degree d ≥ 2 and for every odd k we construct Cayley digraphs of order 2k ( ⌊d2⌋ )k and diameter at most k, where k ≥ 3, and bipartite Cayley digraphs of order 2(k − 1) ( ⌊d2⌋ )k−1 and diameter at most k, where k...
متن کاملOn Digraphs with Non-derogatory Adjacency Matrix
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if . 0 )) ( ( = G A f G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, i.e., the ladder digraphs and the difans, are annihilatingly unique by studying the similari...
متن کاملGeneralized Cayley Digraphs
In this paper we introduce a new class of digraphs induced by groups. These digraphs can be considered as the generalization of Cayley digraphs. Moreover, various graph properties are expressed in terms of algebraic properties. This did not attract much attention in the literature. Mathematics Subject Classification: 05C25
متن کاملCayley digraphs and lexicographic product ∗
In this paper, we prove that a Cayley digraph Γ = Cay(G, S) is a nontrivial lexicographical product if and only if there is a nontrivial subgroup H of G such that S \ H is a union of some double cosets of H in G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.03.086