关于二部图Km1m2-Hm2的升分解

在文献[2]中作者定义了图的一种新分解-升分解(Ascending subgraph Decomposition简记为ASD)，并提出了一个猜想：任意有正数条边的图都可以升分解．本文主要证明了二部图Km1m2-Hm2(m1≥m2)可以升分解，其中Hm2是至多含m2条边的Km1m2的子图．     

Filament sets, aposyndesis, and the decomposition theorem of Jones

Applications of the work introduced by the authors in a recent article, Filament sets and homogeneous continua, are given to aposyndesis and local connectedness. The aposyndetic decomposition theorem of Jones is generalized to spaces with the property of Kelley.

     

图的双控制的一些新结果

图G=(V,E)的每个顶点控制它的闭邻域的每个顶点.S是一个顶点子集合,如果G的每一个顶点至少被S中的两个顶点控制,则称S是G的一个双控制集.把双控制集的最小基数称为双控制数,记为dd(G).本文探讨了双控制数和其它控制参数的一些新关系,推广了[1]的一些结果.并且给出了双控制数的Nordhaus-Gaddum类型的结果.     

有限元网格自动生成及自动调整技术

本文给出了一种任意平面域内三角形网格自动生成及自动调整算法，并编制了相应的程序。通过对带Ｕ形槽的三点变曲试件的分析，证明本文算法是可行的，并且具有稳定性能好、收敛速度快的优点。     

On random k‐out subgraphs of large graphs

We consider random subgraphs of a fixed graph with large minimum degree. We fix a positive integer k and let G_k be the random subgraph where each independently chooses k random neighbors, making kn edges in all. When the minimum degree then G_k is k‐connected w.h.p. for ; Hamiltonian for k sufficiently large. When , then G_k has a cycle of length for . By w.h.p. we mean that the probability of non‐occurrence can be bounded by a function (or ) where . © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 143–157, 2017     

A three‐dimensional cadmium coordination polymer based on 1,4‐bis(1,2,4‐triazol‐1‐yl)but‐2‐ene and benzene‐1,3,5‐tricarboxylic acid

The Cd^II three‐dimensional coordination poly[[[μ₄‐1,4‐bis(1,2,4‐triazol‐1‐yl)but‐2‐ene]bis(μ₃‐5‐carboxybenzene‐1,3‐dicarboxylato)dicadmium(II)] dihydrate], {[Cd₂(C₉H₄O₆)₂(C₈H₁₀N₆)]·2H₂O}_n , (I), has been synthesized by the hydrothermal reaction of Cd(NO₃)₂·4H₂O, benzene‐1,3,5‐tricarboxylic acid (1,3,5‐H₃BTC) and 1,4‐bis(1,2,4‐triazol‐1‐yl)but‐2‐ene (1,4‐btbe). The IR spectrum suggests the presence of protonated carboxylic acid, deprotonated carboxylate and triazolyl groups. The purity of the bulk sample was confirmed by elemental analysis and X‐ray powder diffraction. Single‐crystal X‐ray diffraction analysis reveals that the Cd^II ions adopt a five‐coordinated distorted trigonal–bipyramidal geometry, coordinated by three O atoms from three different 1,3,5‐HBTC²⁻ ligands and two N atoms from two different 1,4‐btbe ligands; the latter are situated on centres of inversion. The Cd^II centres are bridged by 1,3,5‐HBTC²⁻ and 1,4‐btbe ligands into an overall three‐dimensional framework. When the Cd^II centres and the tetradentate 1,4‐btbe ligands are regarded as nodes, the three‐dimensional topology can be simplified as a binodal 4,6‐connected network. Thermogravimetric analysis confirms the presence of lattice water in (I). Photoluminescence studies imply that the emission of (I) may be ascribed to intraligand fluorescence.     

Graphs with No Induced Five‐Vertex Path or Antipath

We prove that a graph G contains no induced ‐vertex path and no induced complement of a ‐vertex path if and only if G is obtained from 5‐cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where split unification is a new class‐preserving operation introduced here.     

Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than .     

边界元法边界层处理的一种新方法—拟多连域法

提出了处理边界元法边界层问题的新方法。这种方法在求得边界未知量后，在距边界较远的域中构造一工作边界，将实际边界与工作边界看作一多连域问题求得工作边界的未知量。再将工作边界与边界层边界视为一多连域问题求解，可得到满足精度要求的边界附近点的位移与应力。这种方法理论简洁、计算方便、有效、精度高，对于需求边界上多点的未知量问题很具优越性     

Circumference and Pathwidth of Highly Connected Graphs

Birmele [J Graph Theory 2003] proved that every graph with circumference t has treewidth at most . Under the additional assumption of 2‐connectivity, such graphs have bounded pathwidth, which is a qualitatively stronger conclusion. Birmele's theorem was extended by Birmele et al. [Combinatorica 2007] who showed that every graph without k disjoint cycles of length at least t has treewidth . Our main result states that, under the additional assumption of ‐connectivity, such graphs have bounded pathwidth. In fact, they have pathwidth . Moreover, examples show that ‐connectivity is required for bounded pathwidth to hold. These results suggest the following general question: for which values of k and graphs H does every k‐connected H‐minor‐free graph have bounded pathwidth? We discuss this question and provide a few observations.