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     

On the existence of a minimum integer representation for?weighted voting systems

A basic problem in the theory of simple games and other fields is to study whether a simple game (Boolean function) is weighted (linearly separable). A second related problem consists in studying whether a weighted game has a minimum integer realization. In this paper we simultaneously analyze both problems by using linear programming. For less than 9 voters, we find that there are 154 weighted games without minimum integer realization, but all of them have minimum normalized realization. Isbell in 1958 was the first to find a weighted game without a minimum normalized realization, he needed to consider 12 voters to construct a game with such a property. The main result of this work proves the existence of weighted games with this property with less than 12 voters. This research was partially supported by Grant MTM 2006-06064 of “Ministerio de Ciencia y Tecnología y el Fondo Europeo de Desarrollo Regional” and SGRC 2005-00651 of “Generalitat de Catalunya”, and by the Spanish “Ministerio de Ciencia y Tecnología” programmes ALINEX (TIN2005-05446 and TIN2006-11345).     

球面和射影平面上不可分地图的色和

给出了球面和射影平面上带根不可分地图的色和方程,从色和方程导出了球面和射影平面上带根一般不可分地图、二部地图的计数函数方程. 利用色和理论,研究不同类地图的计数问题,得到了一种研究计数问题的新方法. 此外,还得到了一些计数显示表达式.     

Bounds relating the weakly connected domination number to the total domination number and the matching number

Let G=(V,E) be a connected graph. A dominating set S of G is a weakly connected dominating set of G if the subgraph (V,E∩(S×V)) of G with vertex set V that consists of all edges of G incident with at least one vertex of S is connected. The minimum cardinality of a weakly connected dominating set of G is the weakly connected domination number, denoted . A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γ_t(G) of G. In this paper, we show that . Properties of connected graphs that achieve equality in these bounds are presented. We characterize bipartite graphs as well as the family of graphs of large girth that achieve equality in the lower bound, and we characterize the trees achieving equality in the upper bound. The number of edges in a maximum matching of G is called the matching number of G, denoted α^′(G). We also establish that , and show that for every tree T.     

拟树图按第二大无符号拉普拉斯特征值排序

A connected graph G=(V,E) is called a quasi-tree graph if there exists a vertex v_0∈V(G) such that G-v_0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.     

关于多元幂级数

引入了多元函数项级数的概念,给出了其收敛域及和函数的定义;通过详实的例子讨论了多元幂级数的收敛域、和函数及多元函数展开为多元幂级数的计算方法.     

Analysis of the coupling constants ga0ηπ0 and ga0η＇ π0 with light-cone QCD sum rules

In this article, we take the point of view that the light scalar meson a0（980） is a conventional qqstate, and calculate the coupling constants ga0ηπ0 and ga0ηπ0 with the light-cone QCD sum rules. The central value of the coupling constant ga0ηπ0 is consistent with that extracted from the radiative decay φ（1020） → a0（980）γ→ηπ0γ. The central value and lower bound of the decay width Γa0→ηπ0 =127＋8448 MeV are compatible with the experimental data of the total decay width Γa0（980） = （50-100） MeV from the Particle Data Group with a very model dependent estimation （the decay width can be much larger）, while the upper bound is too large. We give a possible explanation for the discrepancy between the theoretical calculation and experimental data.     

disjoint cycles containing specified independent vertices

Let k1 be an integer and G be a graph of order n3k satisfying the condition that σ₂(G)n+k-1. Let v₁,…,v_k be k independent vertices of G, and suppose that G has k vertex-disjoint triangles C₁,…,C_k with v_iV(C_i) for all 1ik.Then G has k vertex-disjoint cycles such that

(i) for all 1ik.

(ii) , and

(iii) At least k-1 of the k cycles are triangles.

The condition of degree sum σ₂(G)n+k-1 is sharp.

Weighted nonlinear regression

Minimization of the weighted nonlinear sum of squares of differences may be converted to the minimization of sum of squares. The Gauss-Newton method is recalled and the length of the step of the steepest descent method is determined by substituting the steepest descent direction in the Gauss-Newton formula. The existence of minimum is shown.     

Asymptotic enumeration of sparse 2‐connected graphs

We determine an asymptotic formula for the number of labelled 2‐connected (simple) graphs on n vertices and m edges, provided that m ‐ n →∞ and m = O(nlog n) as n →∞. This is the entire range of m not covered by previous results. The proof involves determining properties of the core and kernel of random graphs with minimum degree at least 2. The case of 2‐edge‐connectedness is treated similarly. We also obtain formulae for the number of 2‐connected graphs with given degree sequence for most (“typical”) sequences. Our main result solves a problem of Wright from 1983. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013