氢化丁苯共聚物结构的核磁共振波谱表征Ⅱ.微观结构的定量计算

在氢化丁苯共聚物¹³C-NMR谱脂肪碳部分谱带归属的基础上,根据各谱带的主要来源,推导出六个二单元浓度的计算公式。计算出二单元、一单元的相对含量,各结构单元的数均序列长度、嵌段含量和其它结构参数。加氢前后的¹H-和¹³C-NMR谱的组成计算结果基本一致。初步探讨了作为粘度指数改进剂的氢化丁苯共聚物微观结构与性能的关系,为合成提供了依据。     

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

小波变换在金融数据分析中的应用

市场上的数据,从本质上讲都是一种时间序列。它和小波分析中的信号具有相同的特性。因此,完全可以将这些经济时间序列看成信号,应用小波变换进行分析和预测。     

Signed graphs for portfolio analysis in risk management

We introduce the notion of structural balance for signed graphsin the context of portfolio analysis. A portfolio of securitiescan be represented as a signed graph with the nodes denotingthe securities and the edges representing the correlation betweenthe securities. With signed graphs, the characteristics of aportfolio from a risk management perspective can be uncoveredfor analysis purposes. It is shown that a portfolio characterizedby a signed graph of positive and negative edges that is structurallybalanced is characteristically more predictable. Investors whoundertake a portfolio position with all positively correlatedsecurities do so with the intention to speculate on the upside(or downside). If the portfolio consists of negative edges andis balanced, then it is likely that the position has a hedgingdisposition within it. On the other hand, an unbalanced signedgraph is representative of an investment portfolio which ischaracteristically unpredictable.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

A characterization of projective-planar signed graphs

A signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative depending on whether it contains an even or odd number of negative edges, respectively. We consider embeddings of a signed graph in the projective plane for which a simple cycle is essential if and only if it is negative. We characterize those signed graphs that have such a projective-planar embedding. Our characterization is in terms of a related signed graph formed by considering the theta subgraphs in the given graph.     

On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.