In this paper, we characterize all finite commutative rings R such that u0393u2032(R) is planar, outerplanar or ring graph.doi:10.1142/S0219498812501034MOJGAN AFKHAMIDepartment of Mathematics, University of Ney
Planar embedding conjecture — Can every planar graph equipped with an arbitrary shortest-path metric be embedded into L1 with only a constant distortion? Anastasios Sidiropoulos solves the case when the metric has non-positive curvature; Chekuri et al. proves the case when the graph is O(1)-ou...
Journal of Nonlinear Mathematical Physics ISSN (Online): 1776-0852 ISSN (Print): 1402-9251 Journal Home Page: https://www.atlantis-press.com/journals/jnmp The Poincaré Series of the Hyperbolic Coxeter Groups with Finite Volume of Fundamental Domains Maxim Chapovalov, Dimitry Leites, Rafael Steko...
In the proposed method, the damage detection is divided into several groups for optimization purposes. Comparing the proposed method with GA, the advantages of the proposed method can be highlighted, such as computational efficiency, less possibility of local optima, and small size of search for ...
pattern recognition/ finite planar setrelative neighbourhood graphgraph structuresminimal spanning treegeometric complexitycomputational perceptiongeometric probabilityDelaunay triangulationpattern recognition/ B6140C Optical information, image and video signal processing C1160 Combinatorial mathematics C1250 Pattern ...
Some preliminaries in graph theory are given in Section 2. The aggressive control of quadrotors with finite-time observer is presented in Section 3. The formation control design and the stability analysis are shown in Section 4. Some simulation and experimental results are given in Section 5. ...
The relative neighbourhood graph (RNG) of a set of n points on the plane is defined. The ability of the RNG to extract a perceptually meaningful structure from the set of points is briefly discussed and compared to that of two other graph structures: the minimal spanning tree (MST) and th...