Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...

‎in this paper‎, ‎we present a novel approach for image selective smoothing by the evolution of two paired nonlinear‎ ‎partial differential equations‎. ‎the distribution coefficient in de-noising equation controls the speed of distribution‎, ‎and is‎ ‎determined by the edge-strength function‎. ‎in the previous works‎, ‎the edge-strength function depends on isotropic‎ ‎smoothing of the image‎, ‎...

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...

The edgelets produced by the Canny edge detector are first thresholded to reduce weak clutter. Beginning from an edgelet, we track along connected neighbours to get a list of edgelets. If one edgelet has more than two neighbours, we check all possible extensions of the curve, and segment the curves on a largest-first basis, breaking the others to form separate curves. This removes small spurs e...

An edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. In this note we prove that K1,m,n is interval colorable if and only if gcd(m+ 1, n+ 1) = 1, where ...

A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the smallest possible number of vertices. In this paper we prove that (k; g)cages are k-edge-connected if k ≥ 3 and g is odd.

-A novel way of matching two images with shifting transformation is studied. The approach is based on the presentation of the virtual edge current in images, and also the study of virtual electromagnetic interaction between two related images inspired by electromagnetism. The edge current in images is proposed as a discrete simulation of the physical current, which is based on the significant e...

A new fuzzy edge detector based on uninorms is proposed and deeply studied. The behaviour of different classes of uninorms is discussed. The obtained results suggest that the best uninorm in order to improve the edge detection process is the uninorm Umin, with underlying Lukasiewicz operators. This algorithm gets statistically substantial better results than the others obtained by well known ed...