共查询到20条相似文献,搜索用时 15 毫秒
1.
Ming-Chien Yang 《Applied mathematics and computation》2010,216(12):3754-3760
The n-dimensional star graph Sn is an attractive alternative to the hypercube graph and is a bipartite graph with two partite sets of equal size. Let Fv and Fe be the sets of faulty vertices and faulty edges of Sn, respectively. We prove that Sn − Fv − Fe contains a fault-free cycle of every even length from 6 to n! − 2∣Fv∣ with ∣Fv∣ + ∣Fe∣ ? n − 3 for every n ? 4. We also show that Sn − Fv − Fe contains a fault-free path of length n! − 2∣Fv∣ − 1 (respectively, n! − 2∣Fv∣ − 2) between two arbitrary vertices of Sn in different partite sets (respectively, the same partite set) with ∣Fv∣ + ∣Fe∣ ? n − 3 for every n ? 4. 相似文献
2.
3.
4.
5.
7.
Joachim Toft 《Applied and Computational Harmonic Analysis》2019,46(1):154-176
We extend Feichtinger's minimality property on the smallest non-trivial time-frequency shift invariant Banach space, to the quasi-Banach case. Analogous properties are deduced for certain matrix spaces.We use these results to prove that the pseudo-differential operator is a Schatten-q operator from to and r-nuclear operator from to when for suitable p, q and r in . 相似文献
8.
《Discrete Mathematics》2020,343(3):111721
The -additive codes are subgroups of , and can be seen as a generalization of linear codes over and . A -linear Hadamard code is a binary Hadamard code which is the Gray map image of a -additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some -linear Hadamard codes of length are equivalent, once is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to , this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on , the full classification of the -linear Hadamard codes of length is established by giving the exact number of such codes. 相似文献
9.
A compact graph-like space is a triple , where is a compact, metrizable space, is a closed zero-dimensional subset, and is an index set such that . New characterizations of compact graph-like spaces are given, connecting them to certain classes of continua, and to standard subspaces of Freudenthal compactifications of locally finite graphs. These are applied to characterize Eulerian graph-like compacta. 相似文献
10.
11.
12.
The bounded edge-connectivity λk(G) of a connected graph G with respect to is the minimum number of edges in G whose deletion from G results in a subgraph with diameter larger than k and the edge-persistence D+(G) is defined as λd(G)(G), where d(G) is the diameter of G. This paper considers the Cartesian product G1×G2, shows λk1+k2(G1×G2)≥λk1(G1)+λk2(G2) for k1≥2 and k2≥2, and determines the exact values of D+(G) for G=Cn×Pm, Cn×Cm, Qn×Pm and Qn×Cm. 相似文献
13.
14.
15.
16.
17.
18.
19.