In this paper, we have defined the concept of m-dominating set in graphs. In order to define this concept we have used the notion of m-adjacent vertices. We have also defined the concepts of minimal m-dominating set, minimum ...

The main aim of this manuscript is to work on the split equilibrium problem with the combined results of the fixed point problem and split variational inequality problem. This paper is an extension of the recent work of ...

A graph with q edges is called antimagic if its edges can be labeled with 1, 2,…,q such that the sums of the labels of the edges incident to each vertex are distinct. Here we prove that the graphs obtained by switching ...

In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem ...

In this paper, we find the best proximity point in G-metric spaces for G-generalized ζ-β-T contraction mappings and verify the existence and uniqueness of the best proximity point in the complete G metric space using the ...

The main concept of this paper is to introduce the notion of GF and GF generalized proximal contraction and to establish the existence and uniqueness of best proximity point for nonself mapping satisfying these contractions ...

The zero divisor graph Γ(R) of a commutative ring R is a graph whose vertices are non-zero zero divisors of R and two vertices are adjacent if their product is zero. The characteristic polynomial of matrix M is defined ...

If a graph G of order n has the Laplacian energy same as that of complete graph Kn then G is said to be L-borderenergeic graph. It is interesting and challenging as well to identify the graphs which are L-borderenergetic ...

The graphs whose energy is same as that of complete graphs are known as borderenergetic graphs. We propose a procedure for the construction of borderenergetic graphs and investigate three sequences of borderenergetic graphs.