胺、醇、醚类化合物电离能的自相关拓扑研究

原子的染色序数 fi 定义为 :fi=gi·xi,式中 gi 为原子i在分子中的序数 ,xi 为其染色系数 .基于fi 建立改进的原子序数自相关拓扑指数mF ,其中的1F对烷烃及其衍生物具有良好的结构选择性 .使用第一电离能 (Ip)与0 F ,1F的数量关系模型对 32种脂肪族胺、醇、醚进行估算、预测 ,结果令人满意     

Analysis of Early Medieval Glass Beads – The Raw Materials to Produce Green, Orange and Brown Colours

 Monochrome coloured glass beads of the Merovingians (5^th–7^th cent. AD) have been examined by different analytical methods. The elemental composition of a large number of mostly unprepared beads have been measured non-destructively by X-ray fluorescence analysis. After subtracting the content of the colouring oxides of the glass beads and normalising the residual values to 100% an identical soda-lime-glass matrix was obtained. X-ray diffraction was used for the identification of the crystalline colouring and opacifying pigments (SnO₂, Cu, Cu₂O, PbSnO₃), and scanning electron microscopy as well as electron probe microanalysis were applied to study the microstructure and the composition of white, brown, green, orange and yellow coloured glass beads. Oxidised metals, alloys (lead, copper, bronze, brass and mixtures of them) and iron smelting slag have been identified as raw materials to colour the soda-lime-glass.     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.     

Asymptotically optimal neighbour sum distinguishing colourings of graphs

Consider a simple graph G = (V,E) and its proper edge colouring c with the elements of the set {1,2,…,k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by . The definition of this parameter, which makes sense for graphs containing no isolated edges, immediately implies that , where Δ is the maximum degree of G. On the other hand, it was conjectured by Flandrin et al. that for all those graphs, except for C₅. We prove this bound to be asymptotically correct by showing that . The main idea of our argument relays on a random assignment of the colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 776–791, 2015     

An improved ant colony optimisation heuristic for graph colouring

The focus of this paper is an ant colony optimisation heuristic for the graph colouring problem. We start by showing how a series of improvements enhance the performance of an existing ant colony approach to the problem and then go on to demonstrate that a further strengthening of the construction phase, combined with a tabu search improvement phase, raise the performance to the point where it is able to compete with some of the best-known approaches on a series of benchmark problems.     

List Edge‐Coloring and Total Coloring in Graphs of Low Treewidth

We prove that the list chromatic index of a graph of maximum degree Δ and treewidth is Δ; and that the total chromatic number of a graph of maximum degree Δ and treewidth is . This improves results by Meeks and Scott.     

关于有限域上一类方程零点个数的估计

By establishing the connection between graph colouring and the solution of some equation systems in finite fields, we obtain some formulas to the number of solutions of some equation systems in finite fields, in terms of chromatic polynomial of a graph.     

Generalised acyclic edge colourings of graphs with large girth

The r-acyclic edge chromatic number of a graph G is the minimum number of colours required to colour the edges of G in such a way that adjacent edges receive different colours and every cycle C receives at least min{|C|,r} colours. We prove that for any integer r?4, the r-acyclic edge chromatic number of any graph G with maximum degree Δ and with girth at least 3(r-1)Δ is at most 6(r-1)Δ.