一维六方准晶中带三条不对称裂纹的圆形孔口问题的解析解

利用复变函数方法,通过构造保角映射,研究了一维六方准晶中带不对称三裂纹的圆形孔口的反平面剪切问题,给出了Ⅲ型裂纹问题的应力强度因子,在极限情形下,不仅可以还原为已有的结果,而且求得一维六方准晶中L裂纹问题在裂纹尖端的应力强度因子.     

SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts

A graph G on n vertices is said to be separable cost constant Hamiltonian (SC-Hamiltonian) if and only if G is Hamiltonian and for any cost matrix C=(c_(i,j)) associated with G where all tours have the same cost, there exist vectors a=(a₁,…,a_n) and b=(b₁,…,b_n) such that . In this paper we show that for symmetric digraphs strong Hamiltonicity is a necessary condition for SC-Hamiltonicity. As a surprising consequence, we prove that the symmetric digraph obtained from an undirected SC-Hamiltonian graph by edge duplication need not be SC-Hamiltonian. This settles a conjecture of Kabadi and Punnen. We then show that an undirected graph on an even number of nodes having an edge that appears in every Hamiltonian cycle cannot be SC-Hamiltonian. Using this we establish that multiple subdivision of an edge need not preserve SC-Hamiltonicity, disproving a previous claim. Further, we identify other necessary conditions for SC-Hamiltonicity and obtain new classes of SC-Hamiltonian graphs.     

A bound on the treewidth of planar even-hole-free graphs

The class of planar graphs has unbounded treewidth, since the k×k grid, ∀k∈N, is planar and has treewidth k. So, it is of interest to determine subclasses of planar graphs which have bounded treewidth. In this paper, we show that if G is an even-hole-free planar graph, then it does not contain a 9×9 grid minor. As a result, we have that even-hole-free planar graphs have treewidth at most 49.     

An application of vertex packing to data analysis in the evaluation of pavement deterioration

The analysis of data concerning the deterioration of pavement over time yielded a problem of aggregating the data in a manner that preserved independence of the aggregated data points and maximized the number of points. We show that this problem can be modeled as a maximum cardinality vertex packing problem on a proper internal graph and thus can be solved very efficiently by a greedy algorithm.     

STABILITY OF A KIND OF COMPOUND BOUNDARY VALUE PROBLEM WITH RESPECT TO THE PERTURBATION OF BOUNDARY CURVE

In this paper, we discuss the stability of general compound boundary value prob-lems combining Riemann boundary value problem for an open arc and Hilbert bound-ary value problem for a unit circle with respect to the perturbation of boundary curve.     

Magnetic circular dichroism of [Co/Pd] and [CoB/Pd] multilayered films

Magnetic circular dichroism (MCD) and X-ray absorption spectra (XAS) at the Co L_2,3-edge of [Co/Pd]₂₀ and [CoB/Pd]₂₀ multilayered films, which were fabricated at 260 °C with different magnetic layer thicknesses (δ), have been measured. The lineshapes of XAS–MCD show that the electronic state of Co 3d of the films hardly changes even when sputtered at higher temperatures. The expectation values of orbital and spin angular momentum (〈L_z〉 and 〈S_z〉) are estimated using the sum rule, and it is found that 〈L_z〉/〈S_z〉 in δ<0.5 nm is larger than that in δ>0.5 nm.     

On the spanning connectivity of the generalized Petersen graphs P(n,3)

In this paper, we employed lattice model to describe the three internally vertex-disjoint paths that span the vertex set of the generalized Petersen graph $P(n,3)$. We showed that the $P(n,3)$ is 3-spanning connected for odd $n$. Based on the lattice model, five amalgamated and one extension mechanisms are introduced to recursively establish the 3-spanning connectivity of the $P(n,3)$. In each amalgamated mechanism, a particular lattice trail was amalgamated with the lattice trails that was dismembered, transferred, or extended from parts of the lattice trails for $P(n?6,3)$, where a lattice tail is a trail in the lattice model that represents a path in $P(n,3)$.     

AFPP vs FPP

The main theme of this paper is that almost fixed point properties of discrete structures and fixed point properties of (topological) spaces are interdeducible via a suitable category which contains both graphs and spaces as objects. To carry out the program, we have to consider (almost) fixed points of multifunctions, and for this we need a preliminary discussion of power structures for graphs and simplicial complexes. Specific applications developed are: a digital convexity (discrete) version of Kakutani's fixed point theorem for convex-valued multifunctions; and fixed point properties of dendrites in terms of those of finite discrete trees.     

关于图的运算与图的Pfaffian性

关于一般的图的完美匹配计数的问题已证实是NP-hard问题.但Pfaffian图的完美匹配计数问题(以及其它相关问题)却能够在多项式时间内解决.由此可见图的Pfaffian性的重要性.在这篇文章中,我们研究了若干种影响图的Pfaffian性的运算.