The Nigeria Geodetic Networks were established using primarily triangulation, traversing, trilateration, doppler and levelling networks for numerous control requirements in both surveying national spatial reference networks. These have a number of inherent negative failings that affect its reliability usage. Various investigations identified many weaknesses the network, starting with origin oth...

The following second definition represents a more up-to-date description of geodesy given by the Committee on Geodesy of the U. S. National Academy of Sciences in 1978. • Establishment and maintenance of national and global three dimensional geodetic networks • Measurement and analyses of geodynamic phenomena (earth rotation, earth tides, crustal movements, etc.) • Determination of the earth's ...

This article describes currently used analysis strategy and data analysis software for geodetic VLBI. Today’s geodetic observing strategies are shortly presented, and the geodetic VLBI observables and data modeling are briefly discussed. A short overview is given on existing geodetic VLBI software packages and the statistical approaches that are applied. Necessary improvements of today’s analys...

A subset S of vertices in a graph G is a called a geodetic dominating set if S is both a geodetic set and a (standard) dominating set. In this paper, we study geodetic domination on graphs.

Due to the limited resolution at depth of geodetic and other geophysical data, the geometry and the loading rate of the ramp-décollement faults below the metropolitan Los Angeles are poorly understood. Here we complement these data by assuming conservation of motion across the Big Bend of the San Andreas Fault. Using a Bayesian approach, we constrain the geometry of the ramp-décollement system ...

We consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call " geodetic ". We construct a convenient basis for the vector space over Q generated by these angles. Geodetic angles and rational linear combinations of geodetic angles appear naturally in Euclidean geometry; for illustration we apply our results to equidecom...

Geodetic sets in graphs are briefly surveyed. After an overview of earlier results, we concentrate on recent studies of the geodetic number and related invariants in graphs. Geodetic sets in Cartesian products of graphs and in median graphs are considered in more detail. Algorithmic issues and relations with several other concepts, arising from various convex and interval structures in graphs, ...

An undirected graph G = (V;E) is said to be geodetic, if between any pair of vertices x; y 2 V there is a unique shortest path. Generalizations of geodetic graphs are introduced in this paper. K-geodetic graphs are de ned as graphs in which every pair of vertices has at most k paths of minimum length between them. Some properties and characterizations of k{geodetic graphs are studied.

A set of vertices S in a graph is called geodetic if every vertex of this graph lies on some shortest path between two vertices from S. In this paper, minimum geodetic sets in median graphs are studied with respect to the operation of peripheral expansion. Along the way geodetic sets of median prisms are considered and median graphs that possess a geodetic set of size two are characterized. © 2...