[1] Unmodelled sub-daily periodic signals can propagate into time series of daily geodetic coordinates and tropospheric estimates at various different frequencies. Geophysical interpretations of geodetic products, particularly at seasonal timescales, can therefore be affected by poorly modelled signals in the geodetic analysis. In this study, we use two solid Earth tidemodels (IERS2003 and IERS...

the basic National horizontal and vertical networks of geodetic control and provides governmentwide leadership in the improvement of geodetic surveying methods and instrumentation, coordinates operations to ass ure network development, and provides specifications and criteria for survey operations by Federal, State, and other agencies. NGS engages in research and development for the improvement...

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...

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...

The geodetic problem was introduced by Harary et al. [17]. In order to model some social network problems, a similar problem is introduced in this paper and named the strong geodetic problem. The problem is solved for complete Apollonian networks. It is also proved that in general the strong geodetic problem is NP-complete.

A set S of vertices of a connected graph G is convex, if for any pair of vertices u, v ∈ S , every shortest path joining u and v is contained in S . The convex hull CH(S ) of a set of vertices S is defined as the smallest convex set in G containing S . The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex ...