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 Neyshabur, P. O. Box 91136-899, Neyshabur, Iran;School of Mathematics, Institute for ...
nerodenatural-numbersnexpopenp-npplanar-graphsposetprobabilistic-methodproblemprocrastinationpuzzleramseyrandomizedreachabilityregular-languagereidemeister-movesrepresentationseparatorset-coversethShortest-pathsspace-complexitysteiner-systemsurface-graphsurface-graphssurveytensortopologytriangulationultrafiltervizingweakly-digestzero...
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 ...
The four period disturbances with the higher probability of generating wind and wave currents are chosen according to the scatter diagram of the sea states, and the numerical simulation verifies the effectiveness of NESO for all of the states observed. Finally, the NTSM and NFTSM are compared ...
(Convergence of Finite-time Coverage Controller with Switching Topology). Let a group of n agents have the agent dynamics defined in (12) and (11). Let these agents be connected via a switching connected Delaunay graph 𝒢𝑛(𝑡)=(𝒱𝑛,ℰ𝑛(𝑡)) for all time 𝑡>0. Let tw...
Let us point out that the both algorithms we use are only applicable to planar lattices. It means that we considered only lattices with free boundary conditions because lattices with periodic boundary conditions do not belong to a planar graph. The length of the lattice varied from 𝐿=25L=25...
Let us point out that the both algorithms we use are only applicable to planar lattices. It means that we considered only lattices with free boundary conditions because lattices with periodic boundary conditions do not belong to a planar graph. The length of the lattice varied from 𝐿=25L=25...
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. ...