In this paper we use the concept of a pair of asymptotically regular and compatible mappings to prove some common fixed point theorems in a complete fuzzy 2-metric space.

We study the connectivity of random d-regular graphs which are recursively generated by an algorithm motivated by a peer to peer network. We show that these graphs are asymptotically almost surely d-connected for any even constant d ≥ 4.

In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d = d(n) = o(n). In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.

In this work we study the deflection and gravitational lensing of null timelike signals in Kiselev spacetime weak field limit, to investigate effects equation state parameter $\omega$ matter amount $\alpha$. doing this, extend a perturbative method previously developed for asymptotically flat spacetimes whose metric functions have integer-power asymptotic expansions case that may or not be but ...

We give a polynomial-time algorithm for detecting very long cycles in dense regular graphs. Specifically, we show that, given $\alpha \in (0,1)$, there exists $c=c(\alpha)$ such that the following holds: is $D$-regular graph $G$ on $n$ vertices with $D\geq \alpha n$, determines whether contains cycle at least $n - c$ vertices. The problem becomes NP-complete if drop either density or regularity...

The inclusions between the Besov spaces $B^q$, Bloch space $\mathcal{B}$ and standard weighted Bergman $A^p_\alpha$ are completely understood, but norms of corresponding inclusion operators in general unknown. In this work, we compute or estimate asymptotically these inclusions.

In this paper we present the following definitions P-asymptotically equivalent probability of multiple L and P-asymptotically probability regular. In addition to these definitions we asked and provide answers for the following questions. (1) If x Probability ≈ y then what type of four dimensional matrices transformation will satisfy the following μ(Ax) Probability ≈ μ(Ay)? (2) If [x] and [y] ar...

LRES, Faculty of Sciences Tunis, University Tunis El Manar, Tunisia EM [email protected] KW Asymptotically linear % variational method Schr?dinger equations Cerami sequence KR nema In this paper, we investigate a quasilinear problem under Dirichlet boundary condition in regular domain with asymptotically nonlinearities. We use version the mountain pass theorem to prove existence solution ...

Consider the following stochastic process on a graph: initially all vertices are uncovered and at each step cover the two vertices of a random edge. What is the expected number of steps required to cover all vertices of the graph? In this note we show that the mean cover time for a regular graph of N vertices is asymptotically (N log N)/2. Moreover, we compute the exact mean cover time for some...

The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the decycling numbers of random regular graphs. For a random cubic graph G of order n, we prove that (G) n/4 1/ 2 holds asymptotically almost surely. This is the result of executing a greedy algorithm for decycling G makin...