Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...

This paper summarizes a system, called SED, "Selection of Edge DetectorsN, which is able to automatically select edge detectors and their scales to extract a given edge. The basic organization of the SED system is a collection of edge detectors within a knowledge structure about the characteristics of the given edge, the properties of the detectors and the mutual relation between them. The comb...

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

Skeletonization is a morphological operation that transforms an original object into a subset, which is called a ‘skeleton’. Skeletonization has been intensively studied for decades and is a challenging issue especially for special target objects. This paper proposes a novel approach to the skeletonization of text images based on stroke width detection. First, the preliminary skeleton is detect...

One of Frank Boesch’s best known papers is ‘The strongest monotone degree conditions for n-connectedness of a graph’ [1]. In this paper, we give a simple sufficient degree condition for a graph to be k-edge-connected, and also give the strongest monotone condition for a graph to be 2-edge-connected.

For a given undirected graph G = (V;E; c G ) with edges weighted by nonnegative reals c G : E ! R + , let G (k) stand for the minimum amount of weights which needs to be added to make G k-edge-connected, and G (k) be the resulting graph obtained from G. This paper rst shows that function G over the entire range k 2 [0;+1] can be computed in O(nm+ n 2 logn) time, and then shows that all G (k) in...

we consider a class of hypergraphs called hypercycles and we show that a hypercycle $c_n^{d,alpha}$ is shellable or sequentially the cohen--macaulay if and only if $nin{3,5}$. also, we characterize cohen--macaulay hypercycles. these results are hypergraph versions of results proved for cycles in graphs.

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.

fragmentation, or breaking apart of habitats, is one of the major causes of decline in biological diversity. mature ecosystems, especially dense forests are very sensitive to this phenomenon and roads are one of the major causes of fragmentation in forest landscapes. present investigation aims to trace landscape fragmentation in dense forests of golestan national park in northeast of iran betwe...

abstract this study addresses two dimensional infiltration from irrigated furrows. the basic approach is to develop a two-dimensional infiltration as a combination of the corresponding one-dimensional vertical and an edge effect. the edge effect is the difference between the cumulative infiltration per unit of adjusted wetting perimeter and the corresponding one-dimensional infiltration. this a...