2-Walk-Regular Dihedrants from Group-Divisible Designs
نویسندگان
چکیده
منابع مشابه
2-Walk-Regular Dihedrants from Group-Divisible Designs
In this note, we construct bipartite 2-walk-regular graphs with exactly 6 distinct eigenvalues as the point-block incidence graphs of group divisible designs with the dual property. For many of them, we show that they are 2-arc-transitive dihedrants. We note that some of these graphs are not described in Du et al. (2008), in which they classified the connected 2-arc transitive dihedrants.
متن کاملWalk-regular divisible design graphs
A divisible design graph (DDG for short) is a graph whose adjacency matrix is the incidence matrix of a divisible design. DDGs were introduced by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs. It turns out that most (but not all) of the known examples of DDGs are walk-regular. In this paper we present an easy criterion for this to happen. In several cases ...
متن کاملOn dihedrants admitting arc-regular group actions
We consider Cayley graphs Γ over dihedral groups, dihedrants for short, which admit an automorphism group G acting regularly on the arc set of Γ . We prove that, if D2n ≤G≤ Aut(Γ ) is a regular dihedral subgroup of G of order 2n such that any of its index 2 cyclic subgroups is core-free in G, then Γ belongs to the family of graphs of the form (Kn1 ⊗ · · · ⊗Kn )[Kc m], where 2n= n1 · · ·n m, and...
متن کاملSplitting group divisible designs with block size 2×4
The necessary conditions for the existence of a (2 × 4, λ)-splitting GDD of type g are gv ≥ 8, λg(v−1) ≡ 0 (mod 4), λg2v(v−1) ≡ 0 (mod 32). It is proved in this paper that these conditions are also sufficient except for λ ≡ 0 (mod 16) and (g, v) = (3, 3).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/5155