This study aimed to evaluate Laser-cutting process of Mild Steel St37 sheets with two different thicknesses. In order to evaluate the quality of cutting edge and the depth of the area affected by the heat, several tests were conducted to determine the effect of parameters such as Laser power, Laser beam movement speed and pressure of axillary gas on the quality of cutting edge and the depth of ...

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

Since branching region of an active nerve fiber is an abrupt widening of the structure, two concepts emerge: first, the stimulating current must be sufficient to raise the outgrowing fibers above the thresh¬old, and secondly, the stimulating current will be divided in proportion to the characteristic admittance of the branches. On the other hand, blocking of the nerve impulse in this region is ...

Since branching region of an active nerve fiber is an abrupt widening of the structure, two concepts emerge: first, the stimulating current must be sufficient to raise the outgrowing fibers above the thresh¬old, and secondly, the stimulating current will be divided in proportion to the characteristic admittance of the branches. On the other hand, blocking of the nerve impulse in this region is ...

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

let $d$ be a digraph with vertex set $v(d)$. for vertex $vin v(d)$, the degree of $v$,denoted by $d(v)$, is defined as the minimum value if its out-degree and its in-degree.now let $d$ be a digraph with minimum degree $deltage 1$ and edge-connectivity$lambda$. if $alpha$ is real number, then the zeroth-order general randic index is definedby $sum_{xin v(d)}(d(x))^{alpha}$. a digraph is maximall...

Ecological edges are increasingly recognized as drivers of landscape patterns and ecosystem processes. In fragmented and patchy landscapes (e.g., a fragmented forest or a savanna with scattered termite mounds), edges can become so numerous that their effects pervade the entire landscape. Results of recent studies in such landscapes show that edge effects can be altered by the presence or proxim...