In this note we show that the edge-connectivity λ(G × H) of the direct product of graphs G and H is bounded below by min{λ(G)|E(H)|, λ(H)|E(G)|, δ(G × H)} and above by min{2λ(G)|E(H)|, 2λ(H)|E(G)|, δ(G×H)} except in some special cases when G is a relatively small bipartite graph, or both graphs are bipartite. Several upper bounds on the vertex-connectivity of the direct product of graphs are al...

Let G be a connected graph with minimum degree id="M3"> δ and vertex-connectivity id="M4"> κ . The id="M5"> is id="M6"> k -connected if id="M7"> ≥ , maximally id="M8"> = super-connected every vertex-cut isol...

PURPOSE Calcaneocuboid arthrodesis was used during revision clubfoot surgery in order to maintain midfoot correction. The purposes of this study were to determine: (1) functional level at 17-year follow-up compared to 5-year follow-up; (2) patients' current functional level, satisfaction, and pain; and (3) current arthropometric measurements. METHODS Twenty patients (27 clubfeet) with clubfoo...

Abstract Critics and film theorists have frequently drawn attention to the use of J. S. Bach’s music in Accattone (1961), Pier Paolo Pasolini’s first film. Many noted strangeness musical choice particular its sociocultural disconnection from film’s setting borgate, deprived areas on outskirts Rome. second film, Mamma Roma (1962), similarly focuses lives an underclass pimps, prostitutes, scroung...

— This paper presents the method for the extraction of the lungs part from the other parts for the diagnostic of the lungs part. The proposed method is based on the calculation of the connected component and the centroid of the image. Connected Component labeling is used to label the each objects in the binarized image. After the labeling is done, centroid value is calculated for each object. T...

In this paper, we describe a new method to identify the writer of Chinese handwriting documents. There are many methods for signature verification or writer identification, but most of them require segmentation or connected component analysis. They are the kinds of content dependent identification methods as signature verification requires the writer to write the same text (e.g. his name). In o...

Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes in G. This article provides a necessary condition for the K node-disjoint paths problem which combines (1) the structure of the reduced graph associated with G, (2) the structure of each strongly connected component o...