For any edge of an isolate free graph , , 〈 〉 is the subgraph induced by the vertices adjacent to u and v in G. We say that an edge x, edominates an edge y if ∈ 〈 〉 . A set ⊆ is an Edge-Edge Dominating Set (EED-set) if every edge in is e-dominated by an edge in L. The edgeedge domination number is the cardinality of a minimum EED-set. We find the relation ship between the new parameter and some...

in this paper, formation of wrinkling in bimetal deep drawing process has been investigated by the analytical, numerical and experimental methods. the effects of width of flange, fillet radii of matrix and punch, clearance of blank holder, contact conditions and relative thickness of two sheets on the number and height of wrinkle waves are studied. clearance and contact conditions have the grea...

Given a simple plane graph G, an edge-face k-coloring of G is a function : E(G) [ F (G) ! f1, . . . ,kg such that, for any two adjacent or incident elements a, b 2 E(G) [ F (G), (a) 61⁄4 (b). Let e(G), ef(G), and (G) denote the edge chromatic number, the edge-face chromatic number, and the maximum degree of G, respectively. In this paper, we prove that ef(G) 1⁄4 e(G) 1⁄4 (G) for any 2-connected...

The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...

in this study, species richness, evenness and vegetation biodiversity were investigated in stabilized and non-stabilized cut edge areas of chachkam district forest roads in sari forest of iran. 18 micro plots 1×1m (36 micro plots) were sampled to carry out this research on two cut edge areas. number of trees, shrubs and herbaceous were recorded in each micro-plot. significant difference was inv...

A geometry in Oracle Spatial can be one of the following1: • Point • Linestring connecting two or more points • Polygon specified as a closed linestring and indicating an area bounded by the linestring (with zero or more holes inside the outer bounding linestring) • Multipoint collection • Multiline collection consisting of unconnected linestrings • Multipolygon collection consisting of nonover...

As a fundamental research object, the minimum edge dominating set (MEDS) problem is of both theoretical and practical interest. However, determining size MEDS number all MEDSs in general graph NP-hard, it thus makes sense to find special graphs for which can be exactly solved. In this paper, we study analytically pseudofractal scale-free web Sierpiński gasket with same vertices edges. For graph...

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.