In 2006, Espinola and Kirk made a useful contribution on combining fixed point theoryand graph theory. Recently, Reich and Zaslavski studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In this paper, by using  the main idea of their work and the idea of combining fixed point theory on intuitionistic fuzzy metric spaces and graph theory, ...

In this paper, we introduce the notion of strictly (α,ψ,ξ)-G-contractive mappings in b-metric spaces endowed with a graph G. We establish a sufficient condition for existence and uniqueness of points of coincidence and common fixed points for such mappings. Our results extend and unify many existing results in the literature. Finally, we construct some examples to analyze and support our results.

Let G be a connected graph with n vertices embedded in a metric space with metric δ. The stretch factor of G is the maximum over all pairs of distinct vertices u, v ∈ G of the ratio δG(u, v)/δ(u, v), where δG(u, v) is the metric distance in G between u and v. We consider the plane equipped with a weighted fixed orientation metric, i.e. a metric that measures the distance between a pair of point...

A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...

Let l be a length function on a group G, and let Ml denote the operator of pointwise multiplication by l on l(G). Following Connes, Ml can be used as a “Dirac” operator for C ∗ r (G). It defines a Lipschitz seminorm on C∗ r (G), which defines a metric on the state space of C∗ r (G). We investigate whether the topology from this metric coincides with the weak-∗ topology (our definition of a “com...

A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W . The metric dimension for G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In order to study the metric dimension for the hierarchical product G2 2 uG1 1 of two rooted graphs G2 2 and G u1 1 , we first introduce a new parameter, the rooted ...

jachymski [ proc. amer. math. soc., 136 (2008), 1359-1373] gave modified version of a banach fixed point theorem on a metric space endowed with a graph. in the present paper, (g, φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. also, hardy-rogers g-contraction have been introduced and some fixed point theorems have been proved. s...