度量空间中带方向图的g-近似最佳邻近对
g-approximate best proximity pairs in metric space with a directed graph
AI总结：
研究带方向图的度量空间中映射的G-近似最佳邻近对存在性，给出了充分条件。
摘要：
设(X,d)为具有有向图G的度量空间，使得集合V(G)和E(G)分别对应于X的顶点和边。我们在赋予图G的度量空间X中，且G的顶点集V(G)与X重合的条件下，获得了映射T存在G-近似最佳邻近对的充分条件。
英文摘要：
Let(X,d) be a metric space that has a directed graph G such that the sets V(G) and E(G) are respectively vertices and edges corresponding to X. We obtain sufficient conditions for the existence of an G-approximate best proximity pair of the mapping T in the metric space X endowed with a graph G such that the set V(G) of vertices of G coincides with X.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
