the edge tenacity te(g) of a graph g is dened as:te(g) = min {[|x|+τ(g-x)]/[ω(g-x)-1]|x ⊆ e(g) and ω(g-x) > 1} where the minimum is taken over every edge-cutset x that separates g into ω(g - x) components, and by τ(g - x) we denote the order of a largest component of g. the objective of this paper is to determine this quantity for split graphs. let g = (z; i; e) be a noncomplete connected spli...

Let I be a n n binary image stored in a n n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.

A fundamental result by Karger [10] states that for any λ-edgeconnected graph with n nodes, independently sampling each edge with probability p = Ω(logn/λ) results in a graph that has edge connectivity Ω(λp), with high probability. This paper proves the analogous result for vertex connectivity, when sampling vertices. We show that for any k-vertex-connected graph G with n nodes, if each node is...

Use vi , i , i , i to denote order, connectivity, edge-connectivity and minimum degree of a graphGi for i=1, 2, respectively. For the connectivity and the edge-connectivity of the Cartesian product graph, up to now, the best results are (G1×G2) 1+ 2 and (G1×G2) 1+ 2. This paper improves these results by proving that (G1×G2) min{ 1+ 2, 2+ 1} and (G1×G2)= min{ 1+ 2, 1v2, 2v1} ifG1 andG2 are conne...

The classical central difference approximations of the derivative of a function based on Taylor series are the same as type III maximally linear digital differentiators for low frequencies. A new ®nite difference formula is derived, which can be implemented as a fullband type IV maximally linear differentiator. The differentiator is compared with type III maximally linear and type IV equiripple...

for the first time in the minkowski space, an rn 1 time-like complementary ruled surface isdescribed and relations are given connected with an asymptotic and tangential bundle of the time-likecomplementary ruled surface. furthermore, theorems are given related to edge space, central space andcentral ruled surface of this complementary ruled surface.

In this paper analysis and comparison of various methods for text detection is carried by using canny edge detection algorithm and MSER based method along with the image enhancement which results in the improved performance in terms of text detection. In addition, we improve current MSERs by developing a contrast enhancement mechanism that enhances region stability of text patterns to remove th...