Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

On a Class of Functionals Whose Local Minima are Global

In this note we introduce a suitable class of functionals, including the class of integral functionals, and prove that any (strict) local minimum of a functional of this class, defined on a decomposable space, is a (strict) global minimum. So, the recent result obtained by Giner in [1] is specified and extended.     

边界衍射波理论公式的准确性数值分析

利用数值分析的方法分析了由边界波理论公式所得的圆形光阑衍射场的光强分布.通过对边界波理论公式所得的光强分布曲线,对几何照明区与阴影区的光强分布曲线与面衍射积分公式所得的光强分布曲线进行比较,分析了边界波理论公式对衍射场描述的准确性.     

Banach空间中的幂级数方程

本文考虑Banach空间中形如x=u+sum from k=1 to ∞(a_kx~k)的幂级数方程,建立了一个比较定理,并将其应用于一定的非线性积分方程.     

STRONG DERIVATIVE AND ITS CONSEQUENCES

We introduce strong derivative, the corresponding Z-integrable and other related concepts. Also, we give an improved version of the fundamental theorem of calculus.     

一类泛圈图

本文证明了如果G是2连通无爪图,G不是圈,n=|v(G)|>q,G的每个导出子图A都满足φ(a_1,a_2),且G中不存在W′作为其导出子图,则G是泛圈图。     

中国邮路问题的0-1规划解法

在用“奇偶点图上作业法”求解“中国邮路问题”时,需检查图中的每一个回路.当图中回路较多时,检查不便且易出错.针对此,本文建立了求解“中国邮路问题”的0-1规划模型,并给出了算例。     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

A complete boundary integral formulation for compressible Navier–Stokes equations

A complete boundary integral formulation for compressible Navier–Stokes equations with time discretization by operator splitting is developed using the fundamental solutions of the Helmholtz operator equation with different order. The numerical results for wall pressure and wall skin friction of two‐dimensional compressible laminar viscous flow around airfoils are in good agreement with field numerical methods. Copyright © 2004 John Wiley & Sons, Ltd.