首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
Let G=(V,E) be any graph without isolated edges. The well known 1–2–3 Conjecture asserts that the edges of G can be weighted with 1,2,3 so that adjacent vertices have distinct weighted degrees, i.e. the sums of their incident weights. It was independently conjectured that if G additionally has no isolated triangles, then it can be edge decomposed into two subgraphs G1,G2 which fulfil the 1–2–3 Conjecture with just weights 1,2, i.e. such that there exist weightings ωi:E(Gi){1,2} so that for every uvE, if uvE(Gi) then dωi(u)dωi(v), where dωi(v) denotes the sum of weights incident with vV in Gi for i=1,2. We apply the probabilistic method to prove that the known weakening of this so-called Standard (2,2)-Conjecture holds for graphs with minimum degree large enough. Namely, we prove that if δ(G)3660, then G can be decomposed into graphs G1,G2 for which weightings ωi:E(Gi){1,2} exist so that for every uvE, dω1(u)dω1(v) or dω2(u)dω2(v). In fact we prove a stronger result, as one of the weightings is redundant, i.e. uses just weight 1.  相似文献   

7.
8.
9.
The tensor product (G1,G2,G3) of graphs G1, G2 and G3 is defined by V(G1,G2,G3)=V(G1)×V(G2)×V(G3)and E(G1,G2,G3)=((u1,u2,u3),(v1,v2,v3)):|{i:(ui,vi)E(Gi)}|2.Let χf(G) be the fractional chromatic number of a graph G. In this paper, we prove that if one of the three graphs G1, G2 and G3 is a circular clique, χf(G1,G2,G3)=min{χf(G1)χf(G2),χf(G1)χf(G3),χf(G2)χf(G3)}.  相似文献   

10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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