This paper is concerned with the existence of closed geodesics on a non–compact manifold M . There are very few papers on such a problem, see [3, 13, 14]. In particular, Tanaka deals with the manifod M = R×S , endowed with a metric g(s, ξ) = g0(ξ) + h(s, ξ), where g0 is the standard product metric on R × S N . Under the assumption that h(s, ξ) → 0 as |s| → ∞, he proves the existence of a closed...

Abstract. This paper presents an efficient algorithm to approximate the Smetric, which normalizes a graph’s assortativity by its maximum possible value. The algorithm is used to track in detail the assortative structure of growing preferential attachment trees, and to study the evolving structure and preferential attachment of several mathematics coauthorship graphs. These graphs’ behavior beli...

‎In this study‎, ‎we investigate topological properties of fuzzy strong‎ b-metric spaces defined in [13]‎. ‎Firstly‎, ‎we prove Baire's theorem for‎ ‎these spaces‎. ‎Then we define the product of two fuzzy strong b-metric spaces‎ ‎defined with same continuous t-norms and show that $X_{1}times X_{2}$ is a‎ ‎complete fuzzy strong b-metric space if and only if $X_{1}$ and $X_{2}$ are‎ ‎complete fu...

In this paper the metric dimension of (the incidence graphs of) particular partial linear spaces is considered. We prove that the metric dimension of an affine plane of order q ≥ 13 is 3q − 4 and describe all resolving sets of that size if q ≥ 23. The metric dimension of a biaffine plane (also called a flag-type elliptic semiplane) of order q ≥ 4 is shown to fall between 2q−2 and 3q−6, while fo...

A vertex w of a connected graph G strongly resolves two vertices u, v ∈ V (G), if there exists some shortest u−w path containing v or some shortest v−w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension ...

A set of vertices S resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. This paper studies the metric dimension of cartesian products G H. We prove that the metric dimension of G G is tied in a strong sense to the minimum order of a so-called doubly resolving set ...

A resolving set of a graph G is a set S ⊆ V (G), such that, every pair of distinct vertices of G is resolved by some vertex in S. The metric dimension of G, denoted by β(G), is the minimum cardinality of all the resolving sets of G. Shamir Khuller et al. [10], in 1996, proved that a graph G with β(G) = 2 can have neither K5 nor K3,3 as its subgraph. In this paper, we obtain a forbidden subgraph...

A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of S, and the minimum cardinality of such a set is called the metric-locationdomination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: ...