Let G be a signed graph, where G = (V; E) is the underlying simple graph and  : E(G) → {± 1} is the sign function on E(G). In this paper, we obtain k-th signed spectral moments and k-th signed Laplacian spectral moments of a signed graph G , together with coe cients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

In this paper, we introduce a suitable generalization of Cayley graphs that is de ned over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.

Let G be a simple connected graph. The Generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the Generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.

Let R be a commutative ring with nonzero identity and H be a nonempty proper subset of R such that R/H is a saturated multiplicatively closed subset of R. Anderson and Badawi [4] introduced the Generalized total graph of R as an undirected simple graph GTH(R) with vertex set as R and any two distinct vertices x and y are adjacent if and only if x + y ϵ H. The main objective of this paper is to study the domination properties of the graph GTH(R). We determine the domination number of GTH(R) and its induced subgraphs GTH(H) and GTH(R/H). We establish a relationship betweenthe domination number of GTH(R) and the same of GTH(R/H). We also establish a relationship between diameter and domination number of GTH(R/H). In addition,we obtain the bondage number of GTH(R). Finally, a relationship between girth and bondage number of GTH(R/H) has been established.

For a graph , we define a total -labeling as a combination of an edge labeling and a vertex labeling , where . The total -labeling is called a vertex irregular reflexive -labeling of if any pair of vertices , have distinct vertex weights , where for any vertex . The smallest value of for which such a labeling exists is called the reflexive vertex strength of , denoted by . In this paper, we present a new lower bound for the reflexive vertex strength of any graph. We investigate the exact values of the reflexive vertex strength of Generalized friendship graphs, corona product of two paths, and corona product of a cycle with isolated vertices by referring to the lower bound. This study discovers some interesting open problems that are worth further exploration.

In this paper, we use the concept of graph convergence of H(., .) -co-accretive mapping introduced by [R. Ahmad, M. Akram, M. Dilshad, graph convergence for theH (., .) -co-accretive mapping with an application, Bull. Malays. Math. Sci. Soc., doi: 10.1007/s40840-014-0103-z, 2014] and define an over-relaxed proximal point method to ob-tain the solution of a Generalized variational inclusion problem in Banach spaces. Our results can be viewed as an extension of some previously known results in this direction.