Magnetic data consists of a sequence of collected points with spatial coordinates and magnetic information. The spatial location of these points needs to be as exact as possible in order to develop a precise interpretation of magnetic anomalies. GPS is a valuable tool for accomplishing this objective, especially if the RTK approach is used. In this paper the VRS (Virtual Reference Station) tech...

In the integration of geodetic networks with different geodetic coordinate systems, the similarity transformation seems to be the most suitable method because the geodetic coordinate systems are designated to be Cartesian (orthogonal). However, this method may always not be practical to use in most surveying works demanding such high accuracies as the coordinates used in the transformation are ...

Let G : (V, E, ω) be a finite, connected, weighted graph without loops and multiple edges. In a weighted graph each arc is assigned a weight by the weight function ω: E    . A u−v path P in G is called a weighted u−v geodesic if the weighted distance between u and v is calculated along P. The strength of a path is the minimum weight of its arcs, and length of a path is the number of edges in...

Crustal movement is one of the main factors influencing the change of the Earth system, especially in its vertical direction, which affects people's daily life through the frequent occurrence of earthquakes, geological disasters, and so on. In order to get a better study and application of the vertical crustal movement,as well as its changes, the foundation and prerequisite areto devise and est...

For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic of cardinality dg(G) is called dg-set of G. The double geodetic numbers of certain standard graphs are o...

[1] The geodetic velocity and strain rate patterns in Anatolia constrain the rheology of the lithosphere, once compared with thin shell finite element tectonic model predictions. Geodetic and modeled deformation favors a hard lithospheric rheology, responsible for the high EastWest horizontal velocities in the center of Anatolia, between 39 –41 N, in proximity of the North Anatolian Fault. The ...

Let tt : (V, E, W ) be a finite, connected, weighted graph without loops and multiple edges. In a weighted graph each arc is assigned a weight by the weight function W : E +. A u v path P in tt is called a weighted u v geodesic if the weighted distance between u and v is calculated along P . The strength of a path is the minimum weight of its arcs, and length of a path is the number of edges in...

Buckley and Harary introduced several graphical invariants related to convexity theory, such as the geodetic number of a graph. These invariants have been the subject of much study and their determination has been shown to be NP -hard. We use the probabilistic method developed by Erdös to determine the asymptotic behavior of the geodetic number of random graphs with fixed edge probability. As a...

We show that for every integer k ≥ 2 and every k graphs G1, G2, . . . , Gk, there exists a hull graph with k hull vertices v1, v2, . . . , vk such that link L(vi) = Gi for 1 ≤ i ≤ k. Moreover, every pair a, b of integers with 2 ≤ a ≤ b is realizable as the hull number and geodetic number (or upper geodetic number) of a hull graph. We also show that every pair a, b of integers with a ≥ 2 and b ≥...

Classic convexity can be extended to graphs in a natural way by considering shortest paths, also called geodesics: a set S of vertices of a graph is convex if it contains all the vertices lying in some geodesic with endpoints in S and the convex hull of a set S of vertices is the minimum convex set containing S. Farber and Jamison [9] characterized the graphs such that every convex set is the c...