Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property

A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J. Discrete Math., 13 (2000), pp. 179–193]. In addition, we show that it is possible to find one such forbidden induced subgraph in linear time in any given graph that is not concave-round. As part of the analysis, we obtain characterizations by minimal forbidden submatrices for the circular-ones property for rows and for the circular-ones property for rows and columns and show that, also for both variants of the property, one of the corresponding forbidden submatrices can be found (if present) in any given matrix in linear time. We make some final remarks regarding connections to some classes of circular-arc graphs.     

Full-Wave Analyses for a Multi-Layered Microstrip Patch Antenna

This paper describes numerical modelling of a dual band multi-layered microstrip patch antenna operating at 35GHz on an in-house semi-insulating GaAs substrate. The simulated and measured resonant frequencies at both lower and upper resonant frequencies will be compared to check the accuracy of the different numerical modelling techniques.     

多层球对高斯波束散射的德拜级数研究

基于广义洛伦兹-米氏理论,利用多层球粒子散射系数的德拜级数展开公式,提出了一种新的研究多层球粒子对高斯波束散射的方法。计算结果与已有的广义洛伦兹-米氏理论算法的计算结果吻合得很好。利用该方法有效分离了折射率分布满足指数变化规律的多层球粒子对高斯波束散射的远区散射场中多阶彩虹的干涉强度分布。数值模拟了双层球的归一化双一阶彩虹强度分布以及各层的一阶彩虹艾里结构。最后分析讨论了高斯波束的入射位置和束腰半径对多层球单阶彩虹强度分布的影响。     

充液层合压电圆柱壳的自由振动

推导得到轴向极化的圆柱型正交各向异性压电弹性力学的三维状态方程，采用细分近似方法，得到了状态方程的解，并建立了圆柱壳内外表面边界量之间的传递关系，分析了内充可压缩流体的层合压电圆柱壳的自由振动问题，给出了频率方程的精确形式，并作了具体计算。     

Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs

A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v∈V(G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.     

偶极子在径向非均匀介质中的电磁场分布

提出了柱状多层介质中的磁偶极子在任意介质层中的电磁场的递推算法，给出了磁偶极子产生的电磁波在柱状多层介质中的反射、透射系数和广义反射系数，从而得到了任意介质层中满足各层界面边界条件的电磁场解析表达式．     

Algorithms for clique-independent sets on subclasses of circular-arc graphs

A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum cardinality of a clique-independent set for a general graph. In the present paper, we propose polynomial time algorithms for finding the maximum cardinality and weight of a clique-independent set of a -free CA graph. Also, we apply the algorithms to the special case of an HCA graph. The complexity of the proposed algorithm for the cardinality problem in HCA graphs is O(n). This represents an improvement over the existing algorithm by Guruswami and Pandu Rangan, whose complexity is O(n²). These algorithms suppose that an HCA model of the graph is given.     

Obstructions to chordal circular-arc graphs of small independence number

A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any two vertices of the quadruple either miss (have no neighbours on) some path connecting the remaining two vertices of the quadruple, or are connected by some path missed by the remaining two vertices. This is akin to the notion of asteroidal triple used in the classical characterization of interval graphs by Lekkerkerker and Boland [Klee, V., What are the intersection graphs of arcs in a circle?, American Mathematical Monthly 76 (1976), pp. 810–813.].In this note, we first observe that blocking quadruples are obstructions for circular-arc graphs. We then focus on chordal graphs, and study the relationship between the structure of chordal graphs and the presence/absence of blocking quadruples.Our contribution is two-fold. Firstly, we provide a forbidden induced subgraph characterization of chordal graphs without blocking quadruples. In particular, we observe that all the forbidden subgraphs are variants of the subgraphs forbidden for interval graphs [Klee, V., What are the intersection graphs of arcs in a circle?, American Mathematical Monthly 76 (1976), pp. 810–813.]. Secondly, we show that the absence of blocking quadruples is sufficient to guarantee that a chordal graph with no independent set of size five is a circular-arc graph. In our proof we use a novel geometric approach, constructing a circular-arc representation by traversing around a carefully chosen clique tree.     

Algorithms for finding clique-transversals of graphs

A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. It is NP-hard to determine the minimum cardinality τ _c of a clique-transversal of G. In this work, first we propose an algorithm for determining this parameter for a general graph, which runs in polynomial time, for fixed τ _c . This algorithm is employed for finding the minimum cardinality clique-transversal of [`(3K₂)]\overline{3K_{2}} -free circular-arc graphs in O(n ⁴) time. Further we describe an algorithm for determining τ _c of a Helly circular-arc graph in O(n) time. This represents an improvement over an existing algorithm by Guruswami and Pandu Rangan which requires O(n ²) time. Finally, the last proposed algorithm is modified, so as to solve the weighted version of the corresponding problem, in O(n ²) time.     

CRACK PROPAGATING IN FUNCTIONALLY GRADED COATING WITH ARBITRARILY DISTRIBUTED MATERIAL PROPERTIES BONDED TO HOMOGENEOUS SUBSTRATE

In this paper, a finite crack with constant length （Yoffe type crack） propagating in a functionally graded coating with spatially varying elastic properties bonded to a homogeneous substrate of finite thickness under anti-plane loading was studied. A multi-layered model is employed to model arbitrary variations of material properties based on two linearly-distributed material compliance parameters. The mixed boundary problem is reduced to a system of singular integral equations that are solved numerically. Some numerical examples are given to demonstrate the accuracy, efficiency and versatility of the model. The numerical results show that the graded parameters, the thicknesses of the interfacial layer and the two homogeneous layers, the crack size and speed have significant effects on the dynamic fracture behavior.