A k-L(2,1)-labeling for a graph G is a function such that whenever and whenever u and v are at distance two apart. The λ-number for G, denoted by λ(G), is the minimum k over all k-L(2,1)-labelings of G. In this pape...A k-L(2,1)-labeling for a graph G is a function such that whenever and whenever u and v are at distance two apart. The λ-number for G, denoted by λ(G), is the minimum k over all k-L(2,1)-labelings of G. In this paper, we show that for or 11, which confirms Conjecture 6.1 stated in [X. Li, V. Mak-Hau, S. Zhou, The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups, J. Comb. Optim. (2013) 25: 716-736] in the case when or 11. Moreover, we show that? if 1) either (mod 6), m is odd, r = 3, or 2) (mod 3), m is even (mod 2), r = 0.展开更多
1,1,1,-Trifluoro-2- substituted- phenyl- 2- propanols- 3- 14C were prepared from addition of methyl- 14C magnesium iodide to appropriate trifluoroacetophenone. These alcohols were converted into tosylatcs by reaction ...1,1,1,-Trifluoro-2- substituted- phenyl- 2- propanols- 3- 14C were prepared from addition of methyl- 14C magnesium iodide to appropriate trifluoroacetophenone. These alcohols were converted into tosylatcs by reaction with n-butyllithium and then with p-toluenesulfonyl chloride. The yield, boiling point or melting point and pertinent spectral data of these compounds are reported.展开更多
An L(2, 1)-labelling 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)│≥2 if dG(u, v) = 1 and │f(u) - f(v)│ ≥ 1 if dG(u, v) = 2. Th...An L(2, 1)-labelling 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)│≥2 if dG(u, v) = 1 and │f(u) - f(v)│ ≥ 1 if dG(u, v) = 2. The L(2, 1)-labelling problem is to find the smallest number, denoted by A(G), such that there exists an L(2, 1)-labelling function with no label greater than it. In this paper, we study this problem for trees. Our results improve the result of Wang [The L(2, 1)-labelling of trees, Discrete Appl. Math. 154 (2006) 598-603].展开更多
图G的一个L(2,1)-标号是对G顶点集合的一个非负整数分配,使得其中相邻的点取得的整数差值至少为2并且距离为2的点取得不同的整数.L(2,1)-标号数就是所有这样的标号分配中最小的标号跨度值.Griggs和Yeh的[Labelling graphs with a condit...图G的一个L(2,1)-标号是对G顶点集合的一个非负整数分配,使得其中相邻的点取得的整数差值至少为2并且距离为2的点取得不同的整数.L(2,1)-标号数就是所有这样的标号分配中最小的标号跨度值.Griggs和Yeh的[Labelling graphs with a condition at distance 2,SIAM J.Discrete Math.,1992,5:586-595]已经证明了,一棵树的L(2,1)-标号数不是△就是△+1.对于最大度为3的树的L(2,1)-标号数,本文给出了一个完全的刻画.展开更多
基金National Natural Science Foundation of China(No.10671074 and No.60673048)Natural Science Foundation of Education Ministry of Anhui Province(No.KJ2007B124 and No.2006KJ256B)
文摘A k-L(2,1)-labeling for a graph G is a function such that whenever and whenever u and v are at distance two apart. The λ-number for G, denoted by λ(G), is the minimum k over all k-L(2,1)-labelings of G. In this paper, we show that for or 11, which confirms Conjecture 6.1 stated in [X. Li, V. Mak-Hau, S. Zhou, The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups, J. Comb. Optim. (2013) 25: 716-736] in the case when or 11. Moreover, we show that? if 1) either (mod 6), m is odd, r = 3, or 2) (mod 3), m is even (mod 2), r = 0.
基金Supported by the Natural Science Foundation of Education Ministry of Anhui Province (No.KJ2010B138)the Foundation for the Excellent Young Talents of Anhui Province(No.2010SQRL136ZD)the Natural Science Foundation of Chuzhou University(No.2008kj013B)
基金The Project Supported by the National Science Foundation of U.S.A.
文摘1,1,1,-Trifluoro-2- substituted- phenyl- 2- propanols- 3- 14C were prepared from addition of methyl- 14C magnesium iodide to appropriate trifluoroacetophenone. These alcohols were converted into tosylatcs by reaction with n-butyllithium and then with p-toluenesulfonyl chloride. The yield, boiling point or melting point and pertinent spectral data of these compounds are reported.
基金Supported by the National Natural Science Foundation of China (No. 10971248,11101057)Anhui Provincial Natural Science Foundation (No. 10040606Q45)Postdoctoral Science Foundation of Jiangsu Provinc (No.1102095C)
文摘An L(2, 1)-labelling 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)│≥2 if dG(u, v) = 1 and │f(u) - f(v)│ ≥ 1 if dG(u, v) = 2. The L(2, 1)-labelling problem is to find the smallest number, denoted by A(G), such that there exists an L(2, 1)-labelling function with no label greater than it. In this paper, we study this problem for trees. Our results improve the result of Wang [The L(2, 1)-labelling of trees, Discrete Appl. Math. 154 (2006) 598-603].
文摘图G的一个L(2,1)-标号是对G顶点集合的一个非负整数分配,使得其中相邻的点取得的整数差值至少为2并且距离为2的点取得不同的整数.L(2,1)-标号数就是所有这样的标号分配中最小的标号跨度值.Griggs和Yeh的[Labelling graphs with a condition at distance 2,SIAM J.Discrete Math.,1992,5:586-595]已经证明了,一棵树的L(2,1)-标号数不是△就是△+1.对于最大度为3的树的L(2,1)-标号数,本文给出了一个完全的刻画.