In this article, we demonstrate some fixed point results that generalisesthe Banach contraction principle in a different way from the previously establishedliterature findings. We provide some fixed point findings ...

The eigenvalue of a graph G is the eigenvalue of its adjacency matrix and the energy E(G) of graph G is the sum of absolute values of its eigenvalues. Two non-isomorphic graphs G1 and G2 of the same order are said to be ...

A proper k - coloring of a graph G is a function f : V (G) → {1, 2, ..., k} such that f (u) 6 = f (v) for all uv ∈ E(G). The color class Si is the subset of vertices of G that is assigned to color i. The chromatic number ...

The graph Gσ is obtained from graph G by attaching self loops on σ vertices. The energy E(Gσ) of the graph Gσ with order n and eigenvalues λ1, λ2, . . . , λn is defined as E(Gσ) = Xn i=1 λi −σ/n.It has been proved that ...

In this article, we develop some PPF dependent fixed point results for nonself mapping in Metric spaces for Prešić-Hardy-Rogers contraction, which is generalization of Prešić type contraction, where the domain space abstract ...

A binary vertex labeling f : E(G) → {0, 1} with induced labeling f ∗ : V (G) → {0, 1} defined by f ∗ P (v) = {f(uv) | uv ∈ E(G)}(mod 2) is called E-cordial labeling of a graph G if the number of vertices labeled 0 ...

The motivation behind this paper is to use hybrid method for searching a typical component of the set of fixed points of an infinite family of nonexpansive mappings and the set of monotone, Lipschtiz continuous variational ...

Eccentricity, Vertex eccentricity labeled matrix, Vertex eccentricity labeled energy In this paper, we introduce the concept of vertex eccentricity labeled energy of a graph. We investigate the vertex eccentricity ...

For a graph with order then total domination polynomial where, is the number of total dominating sets of of cardinality . In this paper,I have obtained the total dominating sets and total domination polynomial of the ...

If for any total dominating set D with v∈V(G) - D there exists a vertex u ∈ D such that uv∈E(G) and |d(v) - d(u)|≤ 1 then D is called the total equitable dominating set. The minimum cardinality of the total equitable ...