many large oil and gas fields in the most productive world regions happen to be fractured. the exploration and development of these reservoirs is a true challenge for many operators. these difficulties are due to uncertainties in geological fracture properties such as aperture, length, connectivity and intensity distribution. to successfully address these challenges, it is paramount to improve ...

Abstract We apply the Darmois and $C^3$ matching conditions to three different spherically symmetric spacetimes. The exterior spacetime is described by Schwarzschild vacuum solution whereas for interior counterpart we choose perfect fluid solutions with same symmetry. show that are satisfied in all cases not fulfilled. argue this difference due a non-physical behavior of pressure on surface.

Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...

let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.

– The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree c is larger than 2.7183, groups of max-matching patterns which differ greatly from each other gradually emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on t...

template matching is a widely used technique in many of image processing and machine vision applications. in this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to rotation, scale, translation and brightness (rstb) changes. for this purpose, we adopt the idea of ring projection transform (rpt) of image. in the proposed algorithm, two novel s...

The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...