Graph limits: An alternative approach to s-graphons

We show that s-convergence of graph sequences is equivalent to the convergence of certain compact sets, called shapes, of Borel probability measures. This result is analogous to the characterization of graphon convergence (with respect to the cut distance) by the convergence of envelopes, due to Dole?al, Grebík, Hladký, Rocha, and Rozhoň.     

On the Dot Product Graph of a Commutative Ring

Let A be a commutative ring with nonzero identity, 1 ≤ n < ∞ be an integer, and R = A × A × … ×A (n times). The total dot product graph of R is the (undirected) graph TD(R) with vertices R* = R?{(0, 0,…, 0)}, and two distinct vertices x and y are adjacent if and only if x·y = 0 ∈ A (where x·y denote the normal dot product of x and y). Let Z(R) denote the set of all zero-divisors of R. Then the zero-divisor dot product graph of R is the induced subgraph ZD(R) of TD(R) with vertices Z(R)* = Z(R)?{(0, 0,…, 0)}. It follows that each edge (path) of the classical zero-divisor graph Γ(R) is an edge (path) of ZD(R). We observe that if n = 1, then TD(R) is a disconnected graph and ZD(R) is identical to the well-known zero-divisor graph of R in the sense of Beck–Anderson–Livingston, and hence it is connected. In this paper, we study both graphs TD(R) and ZD(R). For a commutative ring A and n ≥ 3, we show that TD(R) (ZD(R)) is connected with diameter two (at most three) and with girth three. Among other things, for n ≥ 2, we show that ZD(R) is identical to the zero-divisor graph of R if and only if either n = 2 and A is an integral domain or R is ring-isomorphic to ?₂ × ?₂ × ?₂.     

On the Annihilator Graph of a Commutative Ring

Let R be a commutative ring with nonzero identity, Z(R) be its set of zero-divisors, and if a ∈ Z(R), then let ann _R (a) = {d ∈ R | da = 0}. The annihilator graph of R is the (undirected) graph AG(R) with vertices Z(R)* = Z(R)?{0}, and two distinct vertices x and y are adjacent if and only if ann _R (xy) ≠ ann _R (x) ∪ ann _R (y). It follows that each edge (path) of the zero-divisor graph Γ(R) is an edge (path) of AG(R). In this article, we study the graph AG(R). For a commutative ring R, we show that AG(R) is connected with diameter at most two and with girth at most four provided that AG(R) has a cycle. Among other things, for a reduced commutative ring R, we show that the annihilator graph AG(R) is identical to the zero-divisor graph Γ(R) if and only if R has exactly two minimal prime ideals.     

图的倍图与补倍图

计算机科学数据库的关系中遇到了可归为倍图或补倍图的参数和哈密顿圈的问题．对简单图C,如果V（D（G））：V（G）∪V（G′）E（D（G））=E（C）∪E（C″）U{vivj′｜vi∈V（G）,Vj′∈V（G′）且vivj∈E（G））那么,称D（C）是C的倍图,如果V（D（G））=V（C）∪V（G′）,E（D（C））：E（C）∪E（G′）∪{vivj′}vi∈V（G）,vj′∈V（G’）and vivj∈（G））,称D（C）是G的补倍图,这里G′是G的拷贝．本文研究了D（G）和D的色数,边色数,欧拉性,哈密顿性和提出了D（G） 的边色数是D（G）的最大度等公开问题．     

Boundary Properties of Factorial Classes of Graphs

For a class of graphs X, let be the number of graphs with vertex set in the class X, also known as the speed of X. It is known that in the family of hereditary classes (i.e. those that are closed under taking induced subgraphs) the speeds constitute discrete layers and the first four lower layers are constant, polynomial, exponential, and factorial. For each of these four layers a complete list of minimal classes is available, and this information allows to provide a global structural characterization for the first three of them. The minimal layer for which no such characterization is known is the factorial one. A possible approach to obtaining such a characterization could be through identifying all minimal superfactorial classes. However, no such class is known and possibly no such class exists. To overcome this difficulty, we employ the notion of boundary classes that has been recently introduced to study algorithmic graph problems and reveal the first few boundary classes for the factorial layer.     

On the Soluble Graph of a Finite Simple Group

The maximal independent sets of the soluble graph of a finite simple group G are studied and their independence number is determined. In particular, it is shown that this graph in many cases has an independent set with three vertices.     

On the Reconstruction of a String from Spectral Data

We consider the problem to reconstruct the mass distribution of a string where the mass is concentrated in a finite number of points, or, equivalently, the problem to reconstruct a simply connected mass spring system with unknown masses and stiffness parameters if the following data are given. Problem 1: The spectra of the string and of a modification of the string, or. Problem 2: The spectra of two different modifications of the string. Here a modification of the string is a string which appears if we link the unknown string with another string of known mass distribution. The paper contains a necessary condition for the existence of a solution of Problem 1, and explicit formulas and an algorithm for the solutions of the Problems 1 and 2 under the condition that there exists a solution. For the case that the mass distribution of the unknown string is not discrete we consider the problem to find discrete approximations of this distribution from the respective spectral data. The methods are based on the spectral theory of generalized second order differential operators as developed by M. G. Krein     

Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision

In the graph sharing game, two players share a connected graph G with nonnegative weights assigned to the vertices claiming and collecting the vertices of G one by one, while keeping the set of all claimed vertices connected through the whole game. Each player wants to maximize the total weight of the vertices they have gathered by the end of the game, when the whole G has been claimed. It is proved that for any class of graphs with an odd number of vertices and with forbidden subdivision of a fixed graph (e.g., for the class of planar graphs with an odd number of vertices), there is a constant such that the first player can secure at least the proportion of the total weight of G whenever . Known examples show that such a constant does no longer exist if any of the two conditions on the class (an odd number of vertices or a forbidden subdivision) is removed. The main ingredient in the proof is a new structural result on weighted graphs with a forbidden subdivision.     

On the Differential Polynomial of a Graph

We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G.     

关于全图的强完美性

本文证明了图Ｇ的全图Ｔ（Ｇ）是完美的充分必要条件是Ｇ的块至多含有三个点．同时，得到对全图来说强完美性猜想为真．     

On the Well-Posedness of the Kirchhoff String

Let us consider the Cauchy problem for the quasilinear hyperbolic integro-differential equation

where is an open subset of and is a positive function of one real variable which is continuously differentiable. We prove the well-posedness in the Hadamard sense (existence, uniqueness and continuous dependence of the local solution upon the initial data) in Sobolev spaces of low order.

     

On the Zero-Divisor Graph of a Ring

Let R be a commutative ring with identity, Z(R) its set of zero-divisors, and Nil(R) its ideal of nilpotent elements. The zero-divisor graph of R is Γ(R) = Z(R)\{0}, with distinct vertices x and y adjacent if and only if xy = 0. In this article, we study Γ(R) for rings R with nonzero zero-divisors which satisfy certain divisibility conditions between elements of R or comparability conditions between ideals or prime ideals of R. These rings include chained rings, rings R whose prime ideals contained in Z(R) are linearly ordered, and rings R such that {0} ≠ Nil(R) ? zR for all z ∈ Z(R)\Nil(R).     

关于扇和完全等二部图联图的边染色

得到了扇和完全等二部图联图的边色数.     

On the Structure of a k-Connected Graph

For a k-connected graph G, we introduce the notion of a block and construct a block tree. This construction generalizes, for , the known constructions for blocks of a connected graph. We apply the introduced notions to describe the set of vertices of a k-connected graph G such that the graph remains k-connected after deleting these vertices. We discuss some problems related to simultaneous deleting of vertices of a k-connected graph without loss of k-connectivity. Bibliography: 5 titles.     

On Connection Between the Structure of a Finite Group and the Properties of Its Prime Graph

It is shown that the condition of nonadjacency of 2 and at least one odd prime in the Gruenberg-Kegel graph of a finite group G under some natural additional conditions suffices to describe the structure of G; in particular, to prove that G has a unique nonabelian composition factor. Applications of this result to the problem of recognition of finite groups by spectrum are also considered.Original Russian Text Copyright © 2005 Vasilev A. V.The author was supported by the Russian Foundation for Basic Research (Grant 05-01-00797), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2069.2003.1), the Program Development of the Scientific Potential of Higher School of the Ministry for Education of the Russian Federation (Grant 8294), the Program Universities of Russia (Grant UR.04.01.202), and a grant of the Presidium of the Siberian Branch of the Russian Academy of Sciences (No. 86-197).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 511–522, May–June, 2005.     

关于扇和完全等二部图联图的点可区别边染色

通过结构分析的方法,考虑各种不同情况,给出了一类联图的点可区别的边染色方法,并得到了它的点可区别的边色数.     

环空钻柱结构三维非线性分析

应用有限元理论和牛顿－拉裴逊法对弯曲井眼中环空钻柱结构进行非线性分析．根据变形特点，提出了对不同参量采用不同形式的单元的描述计算分析方法。采用罚函数法处理待定边界问题。计算表明了井眼曲率对钻头侧向力的非线性效应。     

关于扇和完全等二部图联图的均匀全色数

对于一个正常的全染色满足各种颜色所染元素(点和边)数量的和相差不超过1时,称为均匀全染色,其所用最少的染色数称为均匀全色数.本文得到了m+1阶扇Fm和完全等二部图Kn,n的联图Fm∨Kn,n的均匀全色数.     

图G为自构线图的充要条件

首次给出自构线图的定义,并证明:简单图G为自构线图的充要条件是图G为2-正则简单图.     

On Primitive Idempotents of the Strong Endomorphism Monoid of a Graph

51.IntroductionandPreIiminariesThemonoidofendomorphismsofagraph,inparticular,thatofstrongendomorphismsofagraph,hasbeentheobjectofresearchesinthetheoryofsemigroupsforquitesometime(cf.Llj-Lloj).LlJandL2jcanserveasasurvey.Theaimoftheseresearchesistocon-tributetothealgebraicanalysisofgraphs.Thesubjectyieldssomeinterestsincetheresultsoftheseresearchesmayopenvastpossibilitiesforapplicationsofsemigrouptheorytographtheo-ry.InL1]andL3j,ithasbeenprovedthatforfinitegraphG,sEnd(G),themonoidofstrongen…