On some colorings of a double graph

In this note, we present some results concerning the chromatic index, the total chromatic index, the adjacent vertex distinguishing chromatic index and the adjacent vertex distinguishing total chromatic index for double graphs. In particular, we study the double graphs of class 1 and of type 1.     

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes

An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code are asked to be identified, we get the related concept of a locating-dominating set. These notions are closely related to a number of similar and well-studied concepts such as the one of a test cover. In this paper, we study the decision problems Identifying Code and Locating-Dominating Set (which consist in deciding whether a given graph admits an identifying code or a locating-dominating set, respectively, with a given size) and their minimization variants Minimum Identifying Code and Minimum Locating-Dominating Set. These problems are known to be NP-hard, even when the input graph belongs to a number of specific graph classes such as planar bipartite graphs. Moreover, it is known that they are approximable within a logarithmic factor, but hard to approximate within any sub-logarithmic factor. We extend the latter result to the case where the input graph is bipartite, split or co-bipartite: both problems remain hard in these cases. Among other results, we also show that for bipartite graphs of bounded maximum degree (at least 3), the two problems are hard to approximate within some constant factor, a question which was open. We summarize all known results in the area, and we compare them to the ones for the related problem Dominating Set. In particular, our work exhibits important graph classes for which Dominating Set is efficiently solvable, but Identifying Code and Locating-Dominating Set are hard (whereas in all previous works, their complexity was the same). We also introduce graph classes for which the converse holds, and for which the complexities of Identifying Code and Locating-Dominating Set differ.     

Finite groups with a given number of relative centralizers

We will study all finite groups and their subgroups with at most four relative centralizers.     

构造相应于有限维非退化可解李代数的顶点代数

设g是带有非退化不变对称双线性型的有限维可解李代数，该文首先应用g的仿射李代数g的表示理论，构造出一类水平为l的限制g-模Vg（l，0）．然后应用顶点算子的局部理论在hom（Vg（l，0），Vg（l，0）（（x）））中找到一类顶点代数Lvg（l，0）．建立了LVg（l，0）到Vg（l，0）的映射，最后证明了这类映射是顶点代数同构．     

A covariant representation of the Ball–Chiu vertex

In nonabelian gauge theory the three-gluon vertex function contains important structural information, in particular on infrared divergences, and is also an essential ingredient in the Schwinger–Dyson equations. Much effort has gone into analyzing its general structure, and at the one-loop level also a number of explicit computations have been done, using various approaches. Here we use the string-inspired formalism to unify the calculations of the scalar, spinor and gluon loop contributions to the one-loop vertex, leading to an extremely compact representation in all cases. The vertex is computed fully off-shell and in dimensionally continued form, so that it can be used as a building block for higher-loop calculations. We find that the Bern–Kosower loop replacement rules, originally derived for the on-shell case, hold off-shell as well. We explain the relation of the structure of this representation to the low-energy effective action, and establish the precise connection with the standard Ball–Chiu decomposition of the vertex. This allows us also to predict that the vanishing of the completely antisymmetric coefficient function S   of this decomposition is not a one-loop accident, but persists at higher-loop orders. The sum rule found by Binger and Brodsky, which leads to the vanishing of the one-loop vertex in N=4$N=4$ SYM theory, in the present approach relates to worldline supersymmetry.     

Weak Global Dimension of Coherent Rings

In this article, we study the weak global dimension of coherent rings in terms of the left FP-injective resolutions of modules. Let R be a left coherent ring and ? ? the class of all FP-injective left R-modules. It is shown that wD(R) ≤ n (n ≥ 1) if and only if every nth ? ?-syzygy of a left R-module is FP-injective; and wD(R) ≤ n (n ≥ 2) if and only if every (n ? 2)th ? ?-syzygy in a minimal ? ?-resolution of a left R-module has an FP-injective cover with the unique mapping property. Some results for the weak global dimension of commutative coherent rings are also given.     

含有割点的图的最小特征值

Let ψ be a certain set of graphs.A graph is called a minimizing graph in the set ψ if its least eigenvalue attains the minimum among all graphs in ψ.In this paper,we determine the unique minimizing graph in ψn,where ψn denotes the set of connected graphs of order n with cut vertices.     

Mathematical Modeling for One New Method of Breaking Ice Cover

The spatial problem of determining the stress-strain state of an ice plate of finite thickness broken by a patented method is solved using the theory of small elastoplastic strains and a proven numerical method. __________ Translated from Prikladnaya Mekhanika i Tekhnicheskaya Fizika, Vol. 47, No. 2, pp. 139–146, March–April, 2006.     

关于联图K_(2,n)∨P_m的邻点可区别的全染色

一个全染色被称为邻点可区别的如果它满足对任意两个相邻点所关联的色集合不同.本文给出了联图K2,n∨Pm的邻点可区别的全色数并且证明了它满足邻点可区别的全染色猜想.     

关于中紧性的注记

本文利用良序单调复盖、内部保持复盖、次ｏｒｔｈｏ－紧及垫状加细等刻画了中紧性。其次，证明了空间是中紧的当且仅当它是中可膨胀的且具胡性质ｂ。它们分别改进了文献［１］、［２］的相应结果。