首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 187 毫秒
1.
An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.  相似文献   

2.
An orthogonal array of strength t,degree k,order v and index λ,denoted by OAλ(t,k,v),is a λvt× k array on a v symbol set such that each λvt× t subarray contains each t-tuple exactly λ times.An OAλ(t,k,v) is called simple and denoted by SOAλ(t,k,v)if it contains no repeated rows.In this paper,it is proved that the necessary conditions for the existence of an SOAλ(3,5,v) with λ≥ 2 are also sufficient with possible exceptions where v = 6 and λ∈ {3,7,11,13,15,17,19,21,23,25,29,33}.  相似文献   

3.
For positive integers j and k with j ≥ k, an L(j, k)-labeling of a graph G is an assignment of nonnegative integers to V(G) such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L(j, k)-labeling of a graph G is the difference between the maximum and minimum integers it uses. The λj, k-number of G is the minimum span taken over all L(j, k)-labelings of G. An m-(j, k)-circular labeling of a graph G is a function f : V(G) →{0, 1, 2,..., m - 1} such that |f(u) - f(v)|m ≥ j if u and v are adjacent; and |f(u) - f(v)|m 〉 k ifu and v are at distance two, where |x|m = min{|xl|, m-|x|}. The minimum integer m such that there exists an m-(j, k)-circular labeling of G is called the σj,k-number of G and is denoted by σj,k(G). This paper determines the σ2,1-number of the Cartesian product of any three complete graphs.  相似文献   

4.
An L(3, 2, 1)-labeling of a graph G is a function from the vertex set V(G) to the set of all nonnegative integers such that |f(u)-f(v)|≥3 if dG(u,v) = 1, |f(u)-f(v)|≥2 if dG(u,v) = 2, and |f(u)-f(v)|≥1 if dG(u,v) = 3. The L(3, 2,1)-labeling problem is to find the smallest number λ3(G) such that there exists an L(3, 2,1)-labeling function with no label greater than it. This paper studies the problem for bipartite graphs. We obtain some bounds of λ3 for bipartite graphs and its subclasses. Moreover, we provide a best possible condition for a tree T such that λ3(T) attains the minimum value.  相似文献   

5.
A directed triple system of order v,denoted by DTS(v,λ),is a pair(X,B)where X is a v- set and B is a collection of transitive triples on X such that every ordered pair of X belongs toλtriples of B.An overlarge set of disjoint DTS(v,λ),denoted by OLDTS(v,λ),is a collection{(Y\{y},A_i)}_i, such that Y is a(v 1)-set,each(Y\{y},A_i)is a DTS(v,λ)and all A_i's form a partition of all transitive triples of Y.In this paper,we shall discuss the existence problem of OLDTS(v,λ)and give the following conclusion:there exists an OLDTS(v,λ)if and only if eitherλ=1 and v≡0,1(mod 3),orλ=3 and v≠2.  相似文献   

6.
The third edge-connectivity λ3(G) of a graph G is defined as the minimum cardinality over all sets of edges, if any, whose deletion disconnects G and each component of the resulting graph has at least 3 vertices. An upper bound has been established for λ3(G) whenever λ3(G) is well-defined. This paper first introduces two combinatorial optimization concepts, that is, maximality and superiority, of λ3(G), and then proves the Ore type sufficient conditions for G to be maximally and super third edge-connected. These concepts and results are useful in network reliability analysis.  相似文献   

7.
A hybrid triple system of order v and index λ,denoted by HTS(v,λ),is a pair(X,B) where X is a v-set and B is a collection of cyclic triples and transitive triples on X,such that every ordered pair of X belongs to λ triples of B. An overlarge set of disjoint HTS(v,λ),denoted by OLHTS(v,λ),is a collection {(Y \{y},Ai)}i,such that Y is a(v+1)-set,each(Y \{y},Ai) is an HTS(v,λ) and all Ais form a partition of all cyclic triples and transitive triples on Y.In this paper,we shall discuss the existence problem of OLHTS(v,λ) and give the following conclusion: there exists an OLHTS(v,λ) if and only if λ=1,2,4,v ≡ 0,1(mod 3) and v≥4.  相似文献   

8.
Let G be a simple graph with n vertices and m edges. Let λ1, λ2,…, λn, be the adjacency spectrum of G, and let μ1, μ2,…, μn be the Laplacian spectrum of G. The energy of G is E(G) = n∑i=1|λi|, while the Laplacian energy of G is defined as LE(G) = n∑i=1|μi-2m/n| Let γ1, γ2, ~ …, γn be the eigenvalues of Hermite matrix A. The energy of Hermite matrix as HE(A) = n∑i=1|γi-tr(A)/n| is defined and investigated in this paper. It is a natural generalization of E(G) and LE(G). Thus all properties about energy in unity can be handled by HE(A).  相似文献   

9.
I. Cahit calls a graph H-cordial if it is possible to label the edges with the numbers from the set{1,-1} in such a way that, for some k, at each vertex v the sum of the labels on the edges incident with v is either k or-k and the inequalities |v(k)-v(-k)| ≤ 1 and|e(1)-e(-1)| ≤ 1 are also satisfied. A graph G is called to be semi-H-cordial, if there exists a labeling f, such that for each vertex v, |f(v)| ≤ 1, and the inequalities |e_f(1)-e_f(-1)| ≤ 1 and |vf(1)-vf(-1)| ≤ 1 are also satisfied. An odd-degree(even-degree) graph is a graph that all of the vertex is odd(even) vertex. Three conclusions were proved:(1) An H-cordial graph G is either odd-degree graph or even-degree graph;(2) If G is an odd-degree graph, then G is H-cordial if and only if |E(G)| is even;(3) A graph G is semi-H-cordial if and only if |E(G)| is even and G has no Euler component with odd edges.  相似文献   

10.
Neighbor sum distinguishing total colorings of K 4-minor free graphs   总被引:2,自引:0,他引:2  
A total [k]-coloring of a graph G is a mapping φ: V(G) U E(G) →{1, 2, ..., k} such that any two adjacent elements in V(G)UE(G) receive different colors. Let f(v) denote the sum of the colors of a vertex v and the colors of all incident edges of v. A total [k]-neighbor sum distinguishing-coloring of G is a total [k]-coloring of G such that for each edge uv E E(G), f(u) ≠ f(v). By tt [G, Xsd( J, we denote the smallest value k in such a coloring of G. Pilniak and Woniak conjectured X'sd(G) 〈 A(G) + 3 for any simple graph with maximum degree A(G). This conjecture has been proved for complete graphs, cycles, bipartite graphs, and subcubic graphs. In this paper, we prove that it also holds for Ka-minor free graphs. Furthermore, we show that if G is a Ka-minor flee graph with A(G) 〉 4, then " Xnsd(G) 〈 A(G) + 2. The bound A(G) + 2 is sharp.  相似文献   

11.
Let G = (V, E) be an undirected graph and C(G){{\mathcal C}(G)} denote the set of all cycles in G. We introduce a graph invariant cycle discrepancy, which we define as
${\rm cycdisc}(G) = \min_{\chi: V \mapsto \{+1, -1\}} \max_{ C \in {\mathcal C} (G)} \left|\sum_{v \in C} \chi(v)\right|.${\rm cycdisc}(G) = \min_{\chi: V \mapsto \{+1, -1\}} \max_{ C \in {\mathcal C} (G)} \left|\sum_{v \in C} \chi(v)\right|.  相似文献   

12.
The purpose of the paper is to study sharp weak-type bounds for functions of bounded mean oscillation. Let 0 p ∞ be a fixed number and let I be an interval contained in R. The author shows that for any φ : I → R and any subset E I of positive measure,For each p, the constant on the right-hand side is the best possible. The proof rests on the explicit evaluation of the associated Bellman function. The result is a complement of the earlier works of Slavin, Vasyunin and Volberg concerning weak-type, L ~p and exponential bounds for the BMO class.  相似文献   

13.
Let $\Omega$ be a bounded domain in ${\bf R^n}$ with Lipschitz boundary, $\lambda >0,$ and $1\le p \le (n+2)/(n-2)$ if $n\ge 3$ and $1\le p< +\infty$ if $n=1,2$. Let $D$ be a measurable subset of $\Omega$ which belongs to the class $ {\cal C}_{\beta}=\{D\subset \Omega \quad | \quad |D|=\beta\} $ for the prescribed $\beta\in (0, |\Omega|).$ For any $D\in{\cal C}_{\beta}$, it is well known that there exists a unique global minimizer $u\in H^1_0(\Omega)$, which we denote by $u_D$, of the functional \[\quad J_{\Omega,D}(v)=\frac12\int_{\Omega}|\nabla v|^2\, dx+\frac{\lambda}{p+1}\int_{\Omega}|v|^{p+1}\, dx -\int_{\Omega}\chi_Dv\,dx \] on $H^1_0(\Omega)$. We consider the optimization problem $ E_{\beta,\Omega}=\inf_{D\in {\cal C}_{\beta}} J_D(u_D) $ and say that a subset $D^*\in {\cal C}_{\beta}$ which attains $E_{\beta,\Omega}$ is an optimal configuration to this problem. In this paper we show the existence, uniqueness and non-uniqueness, and symmetry-preserving and symmetry-breaking phenomena of the optimal configuration $D^*$ to this optimization problem in various settings.  相似文献   

14.
确定了广义超特殊p-群G的自同构群的结构.设|G|=p~(2n+m),|■G|=p~m,其中n≥1,m≥2,Aut_fG是AutG中平凡地作用在Frat G上的元素形成的正规子群,则(1)当G的幂指数是p~m时,(i)如果p是奇素数,那么AutG/AutfG≌Z_((p-1)p~(m-2)),并且AutfG/InnG≌Sp(2n,p)×Zp.(ii)如果p=2,那么AutG=Aut_fG(若m=2)或者AutG/AutfG≌Z_(2~(m-3))×Z_2(若m≥3),并且AutfG/InnG≌Sp(2n,2)×Z_2.(2)当G的幂指数是p~(m+1)时,(i)如果p是奇素数,那么AutG=〈θ〉■Aut_fG,其中θ的阶是(p-1)p~(m-1),且Aut_f G/Inn G≌K■Sp(2n-2,p),其中K是p~(2n-1)阶超特殊p-群.(ii)如果p=2,那么AutG=〈θ_1,θ_2〉■Aut_fG,其中〈θ_1,θ_2〉=〈θ_1〉×〈θ_2〉≌Z_(2~(m-2))×Z_2,并且Aut_fG/Inn G≌K×Sp(2n-2,2),其中K是2~(2n-1)阶初等Abel 2-群.特别地,当n=1时...  相似文献   

15.
设$D$是一个非平凡的对称$(v,k,\lambda)$设计, $G$是$D$的一个自同构群.本文证明了如果$G$以二维典型群PSL$(2,q)$作为基柱且在$D$上的作用是旗传递和点本原的,那么设计$D$的参数只能为$(7, 3, 1)$, $(7, 4, 2)$, $(11, 5, 2)$, $(11, 6, 3)$或$(15, 8, 4)$.  相似文献   

16.
该文证明带有粗糙核的分数次积分算子的多线性算子\[T_{\Omega,\alpha}^{A}(f)(x)={\rm {\rm p.v.}}\int_{R^{n}}P_{m}(A;x,y)\frac{\Omega(x-y)}{|x-y|^{n-\alpha+m-1}}f(y){\rm d}y\]的$(H^{1}(\rr^{n}),L^{\frac{n}{n-\alpha},\infty}(\rr^{n}))$有界性.  相似文献   

17.
In this paper, we study the uniform Hölder continuity of the generalized Riemann function \({R_{\alpha,\beta} \,\,{\rm (with}\,\, \alpha > 1 \,\,{\rm and}\,\, \beta > 0}\)) defined by
$$R_{\alpha,\beta}(x) = \sum_{n=1}^{+\infty} \frac{\sin(\pi n^\beta x)}{n^\alpha},\quad x \in \mathbb{R},$$
using its continuous wavelet transform. In particular, we show that the exponent we find is optimal. We also analyse the behaviour of \({R_{\alpha,\beta} \,\,{\rm as}\,\, \beta}\) tends to infinity.
  相似文献   

18.
K2,4×Sn的交叉数   总被引:1,自引:0,他引:1  
Garey和Johnson证明了确定图的交叉数是一个NP-完全问题.确定了笛卡尔积图$K_{2,4}\times S_{n}$的交叉数是$Z(6,n)+4n.$ 当$m\geq 5,$猜想${\rm cr}(K_{2,m}\timesS_{n})={\rm cr}(K_{2,m,n})+n\lfloor\frac{m}{2}\rfloor\lfloor\frac{m-1}{2}\rfloor$.  相似文献   

19.
For a probability measure μ on a subset of , the lower and upper Lq-dimensions of order are defined by We study the typical behaviour (in the sense of Baire’s category) of the Lq-dimensions and . We prove that a typical measure μ is as irregular as possible: for all q ≥ 1, the lower Lq-dimension attains the smallest possible value and the upper Lq-dimension attains the largest possible value.  相似文献   

20.
In this paper,we obtain that b∈ BMO(R~n) if and only if the commutator[b,I_α]is bounded from the Morrey spaces L~(p_1,λ_1)(R~n)×L~(p_2,λ_2)(R~n) to L~(q,λ)(R~n),for some appropriate indices p,q,λ,μ.Also we show that b ∈ Lip_β(R~n) if and only if the commutator[b,I_α]is bounded from the Morrey spaces L~(p_1,λ_1)(R~n)×L~(p_2,λ_2)(R~n) to L~(q,λ)(R~n),for some appropriate indices p,q,λ,μ.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号