pore network modeling uses a network of pores connected by throats to model the void space of a porous medium and tries to predict its various characteristics during multiphase flow of various fluids. in most cases, a non-realistic regular lattice of pores is used to model the characteristics of a porous medium. although some methodologies for extracting geologically realistic irregular network...

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

King [3] introduced and examined the concepts of almost A-summable sequence, almost conservative matrix and almost regular matrix. In this paper, we introduce and examine the concepts of λ-almost A-summable sequence, λalmost conservative matrix and λ-almost regular matrix. Also we introduce statistically (V, λ)-summable sequence.

In 1911, Steinhaus presented the following theorem: if A is a regular matrix then there exists a sequence of 0’s and 1’s which is not A-summable. In 1943, R. C. Buck characterized convergent sequences as follows: a sequence x is convergent if and only if there exists a regular matrix A which sums every subsequence of x. In this paper, definitions for “subsequences of a double sequence” and “Pri...

We describe the generic change of the partial multiplicities at a given eigenvalue λ0 of a regular matrix pencil A0 + λA1 under perturbations with low normal rank. More precisely, if the pencil A0 + λA1 has exactly g nonzero partial multiplicities at λ0, then for most perturbations B0 + λB1 with normal rank r < g the perturbed pencil A0 + B0 + λ(A1 + B1) has exactly g − r nonzero partial multip...

Irregular applications are critical to supporting grand challenge applications on massively parallel machines and extending the utility of those machines beyond the scientiic computing domain. The dominant parallel programmingmodels, data parallel and explicit message passing, provide little support for programming irregular applications. We articulate a set of requirements for supporting irreg...