Effect of spatial dispersion on the spectrum of inter-edge magnetoplasmons in the two-dimensional heterogeneous system. 1 Abstract The present paper is devoted to the theoretical study of the spectrum of low-frequency electronic density oscillations (plasmon waves) running along the boundary of two contacting two-dimensional electronic systems in the perpendicular magnetic field. For the first ...

Introduction: A structured methodology aimed at the automated recognition of impact craters on planetary surfaces is presented. The initial phase focus on edge detection; this is followed by a crucial step, in which a template matching procedure is employed to create a probability volume from which the best candidates are selected and undergo a third phase, designed to detect the centers and es...

A method of noise reduction proposed for the next generation aircraft is to shield from propulsion system, by positioning source over a wing or another surface. In this paper, an approximate analysis developed acoustic field far circular placed near edge semi-infinite plate, model problem shielding and scattering trailing edge. The approximation small radius found be accurate when compared full...

‎let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$‎. ‎we also determine‎ ‎exact value of this parameter for the cartesian product of ...

One of the objectives of a Delaunay mesh refinement algorithm is to produce meshes with tetrahedral elements having a bounded aspect ratio, which is the ratio between the radius of the circumscribing and inscribing spheres. The refinement is carried out by inserting additional Steiner vertices inside the circumsphere of a poor-quality tetrahedron (to remove the tetrahedron) at a sufficient dist...

For a non-trivial connected graph G, a set S ⊆ V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets and any edge geodetic set of order g1(G) is an edge geodetic basis. A connected edge geodetic set of G is an edge geodetic set S such that the ...

In this paper, we study some extremal problems of three kinds of spectral radii of k-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence Q-spectral radius). We call a connected and acyclic k-uniform hypergraph a supertree. We introduce the operation of “moving edges” for hypergraphs, together with the two special cases of this operation: ...

In this study, the effects of punch edge radius and blanking clearance on product quality process in AISI 304 stainless steel sheet were investigated by using fi-nite element analysis method. The analyzes performed at four different tip radii (0.01, 0.25, 0.5, 1 mm) three (1 %, 5%, 10%). As a result analysis, rollover, burr length increased, smooth sheared / fractured surface ratio force decrea...

For a non-trivial connected graph G, a set S ⊆ V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets and any edge geodetic set of order g1(G) is an edge geodetic basis. A connected edge geodetic set of G is an edge geodetic set S such that the ...

A graph is called radially maximal if it not complete and the addition of any new edge decreases its radius. In 1976 Harary Thomassen proved that radius $r$ diameter $d$ satisfy $r\le d\le 2r-2.$ Dutton, Medidi Brigham rediscovered this result with a different proof in 1995 they posed conjecture converse true, is, are positive integers satisfying 2r-2,$ then there exists $d.$ We prove little mo...