共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
《Discrete Mathematics》2022,345(11):113059
Let be the finite field of q elements and let be the dihedral group of 2n elements. Left ideals of the group algebra are known as left dihedral codes over of length 2n, and abbreviated as left -codes. Let . In this paper, we give an explicit representation for the Euclidean hull of every left -code over . On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left -codes over . In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left -codes and self-dual left -codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left -code over , and present several numerical examples to illustrative our applications. 相似文献
3.
In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose is a sequence of finite and connected graphs that share a common universal cover and such that the proportion of eigenvalues of that lie within the support of the spectrum of tends to 1 in the large limit. This is a weak notion of being Ramanujan. We prove such a sequence of graphs is asymptotically locally tree-like. This is deduced by way of an analogous theorem proved for certain infinite sofic graphs and unimodular networks, which extends results for regular graphs and certain infinite Cayley graphs. 相似文献
4.
《Discrete Mathematics》2023,346(1):113160
Let and respectively denote a path and a cycle on k vertices. In this paper, we give necessary and sufficient conditions for the existence of a complete -decomposition of even regular complete equipartite graphs for all prime p. 相似文献
5.
6.
7.
《Discrete Mathematics》2022,345(5):112805
Given a graph H and an integer , let be the smallest number of colors C such that there exists a proper edge-coloring of the complete graph with C colors containing no k vertex-disjoint color isomorphic copies of H. In this paper, we prove that where is the 1-subdivision of the complete graph . This answers a question of Conlon and Tyomkyn (2021) [4]. 相似文献
8.
9.
10.
11.
12.
13.
14.
In 2009, Kyaw proved that every -vertex connected -free graph with contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected -free graphs. We show that every -vertex connected -free graph with contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “” is best possible. 相似文献
15.
16.
17.
For given graphs , , the -color Ramsey number, denoted by , is the smallest integer such that if we arbitrarily color the edges of a complete graph of order with colors, then it always contains a monochromatic copy of colored with , for some . Let be a cycle of length and a star of order . In this paper, firstly we give a general upper bound of . In particular, for the 3-color case, we have and this bound is tight in some sense. Furthermore, we prove that for all and , and if is a prime power, then the equality holds. 相似文献
18.
Let be an array of nonnegative numbers satisfying the recurrence relation with and unless . In this paper, we first prove that the array can be generated by some context-free Grammars, which gives a unified proof of many known results. Furthermore, we present criteria for real rootedness of row-generating functions and asymptotical normality of rows of . Applying the criteria to some arrays related to tree-like tableaux, interior and left peaks, alternating runs, flag descent numbers of group of type , and so on, we get many results in a unified manner. Additionally, we also obtain the continued fraction expansions for generating functions related to above examples. As results, we prove the strong -log-convexity of some generating functions. 相似文献
19.