马尾松幼龄阶段的生长规律

<正>研究表明,马尾松幼树顶芽大小和春梢长度呈正相关。计算得出估测高生长量的Logistic方程和Ⅱ型S型曲线方程。春梢生长速率和气温的关系最为密切,适于春梢生长的旬平均气温为10～30℃,20℃左右生长速率最大。直径月生长量的季节变化与月降雨量及日平均净光合率的季节波动相一致。一年生叶的日平均净光合率于5月底达一年中最大值,7～9月由于干旱而明显下降,10月达一年中的第二峰值。     

管径对碳纳米管负载铂催化剂氧还原的影响

A series of nanocatalysts consisting of acid treated carbon nanotubes (CNTs) with different diameters (8-15, 20-30, 30-50, >50 nm) supporting platinum (Pt) nanoparticles (Pt/CNTs) were synthesized via a microwave-assisted ethylene glycol method. The as-synthesized catalysts were characterized by X-ray photoelectron spectroscopy (XPS), X-ray diffraction (XRD), thermogravimetric analysis (TGA), and transmission electron microscopy (TEM). Their catalytic performances in the oxygen reduction reaction (ORR) were evaluated by cyclic voltammetry (CV) and linear sweep voltammetry (LSV). The experimental results showed that the diameter of the CNTs influences the particle size, loading, and dispersion of Pt NPs. Furthermore, the Pt/CNTs having different CNT diameters displayed different catalytic activities in the ORR. The catalyst Pt/CNT₈, which was prepared by using CNTs with diameters ranging between 8-15 nm as the support, exhibited the highest Pt loading, catalytic activity, and stability in the ORR. The mass activity of Pt/CNT₈ was determined to be 0.188 A·mg^-1 at 0.9 V, which is folds higher than that of the commercially available JM Pt/C catalyst. After testing the stability for 5000 potential cycles, the negative shift (~7 mV) of the half-wave potential for Pt/CNT₈ was found to be significantly lesser than that for the JM Pt/C catalyst (~32 mV), indicating superior catalytic stability.     

Zero Divisor Graph for the Ring of Gaussian Integers Modulo n

This article studies the zero divisor graph for the ring of Gaussian integers modulo n, Γ (? _n [i]). For each positive integer n, the number of vertices, the diameter, the girth and the case when the dominating number is 1 or 2 is found.

Complete characterizations, in terms of n, are given of the cases in which Γ (? _n [i]) is complete, complete bipartite, planar, regular or Eulerian.     

家用电器用电源变压器的计算

介绍一种简易实用的绕制电源变压器计算方法。     

2族3-紧优的有向双环网络无限族

该文给出一种寻找k-紧优的双环网络无限族(k≥0)的方法,利用此方法得到了2族 3-紧优的有向双环网络无限族．     

Bandwidth of the composition of two graphs

The bandwidth B(G) of a graph G is the minimum of the quantity max{|f(x)−f(y)| : xyE(G)} taken over all proper numberings f of G. The composition of two graphs G and H, written as G[H], is the graph with vertex set V(G)×V(H) and with (u₁,v₁) is adjacent to (u₂,v₂) if either u₁ is adjacent to u₂ in G or u₁=u₂ and v₁ is adjacent to v₂ in H. In this paper, we investigate the bandwidth of the composition of two graphs. Let G be a connected graph. We denote the diameter of G by D(G). For two distinct vertices x,yV(G), we define w_G(x,y) as the maximum number of internally vertex-disjoint (x,y)-paths whose lengths are the distance between x and y. We define w(G) as the minimum of w_G(x,y) over all pairs of vertices x,y of G with the distance between x and y is equal to D(G). Let G be a non-complete connected graph and let H be any graph. Among other results, we prove that if |V(G)|=B(G)D(G)−w(G)+2, then B(G[H])=(B(G)+1)|V(H)|−1. Moreover, we show that this result determines the bandwidth of the composition of some classes of graphs composed with any graph.     

On the Diameter of Wenger Graphs

Let q be a prime power, the field of q elements, and n≥1 a positive integer. The Wenger graph W _n (q) is defined as follows: the vertex set of W _n (q) is the union of two copies P and L of (n+1)-dimensional vector spaces over , with two vertices (p ₁,p ₂,…,p _n+1)∈P and [l ₁,l ₂,…,l _n+1]∈L being adjacent if and only if l _i +p _i =p ₁ l _i−1 for 2≤i≤n+1. Graphs W _n (q) have several interesting properties. In particular, it is known that when connected, their diameter is at most 2n+2. In this note we prove that the diameter of connected Wenger graphs is 2n+2 under the assumption that 1≤n≤q−1.     

Paired Domination Vertex Critical Graphs

Let γ _pr (G) denote the paired domination number of graph G. A graph G with no isolated vertex is paired domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, γ _pr (G – v) < γ _pr (G). We call these graphs γ _pr -critical. In this paper, we present a method of constructing γ _pr -critical graphs from smaller ones. Moreover, we show that the diameter of a γ _pr -critical graph is at most and the upper bound is sharp, which answers a question proposed by Henning and Mynhardt [The diameter of paired-domination vertex critical graphs, Czechoslovak Math. J., to appear]. Xinmin Hou: Research supported by NNSF of China (No.10701068 and No.10671191).     

There's something about the diameter

We study diameter preserving linear bijections from onto where X, Y are compact Hausdorff spaces and V, Z are Banach spaces. For instance, we obtain that if X has at least four points, Z is linearly isometric to V and either Z is a space or Z^* is strictly convex or smooth, then there is a diameter preserving linear bijection from onto if and only if X is homeomorphic to Y. We also consider the case when X and Y are not compact but locally compact spaces.