Best proximity point problem in S-M(S-metric) spaces is thought to be a generalization of a G- metric spaces. In this study, we provide proof a best proximity points theorem of αs−Proximal mapping admissible and its several ...

The zero divisor graph of a commutative ring is a graph whose vertices are non-zero zero divisors of and two vertices are adjacent if their product is zero. The characteristic polynomial of matrix is defined as and roots ...

In this paper, we introduce an iteration based on composite Weiner-Hopf equation technique to find the common solution of the set of solution of composite generalized variational inequality, set of equilibrium problem and ...

Abstract A dominating set is said to be a congruent dominating set of a graph if . The minimum cardinality of a minimal congruent dominating set of is called the congruent domination number of which is denoted by . In ...

For a graph G with n vertices and m edges, the eigenvalues of its adjacency matrix A(G) are known as eigenvalues of G. The sum of absolute values of eigenvalues of G is called the energy of G. The Laplacian matrix of G is ...

In the present paper, we propose a new iteration process named as SM-iteration and compare its rate of convergence with the already existing iterations such as CR, S, Abbas, Thakur for different type of functions with the ...

We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2 and Pn × P2 are E-cordial for n even while Wn × P2 and K1,n × P2 are E-cordial for n odd.

Let G be a bipartite graph with a partite sets V1 and V2 and G′ be the copy of G with corresponding partite sets V1 ′ and V2 ′ . The mirror graph M(G) of G is obtained from G and G′ by joining each vertex of V1 ...

We determine the energy of a graph obtained by means of graph operations on a given graph, and relate the energy of such a new graph with that of the given graph.

A dominating set S ⊆ V is said to be a restrained dominating set of graph G if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. A set S ⊆ V is called an equitable dominating set if for ...