A vertex set D in graph G is called a geodetic set if all vertices of G are lying on some shortest u–v path of G, where u, v 2 D. The geodetic number of a graph G is the minimum cardinality among all geodetic sets. A subset S of a geodetic set D is called a forcing subset of D if D is the unique geodetic set containing S. The forcing geodetic number of D is the minimum cardinality of a forcing ...

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

The coordinates of a location obtained from a Global Positioning System (GPS) receiver depend on the type of environments. This paper discusses the errors in GPS coordinate conversion from the World Geodetic System 84 (WGS84) to the Universal Transverse Mercator (UTM) system, in different environments and their reduction using Kalman filter. 30 samples of positional coordinates, each for three ...

Using satellite cloud images to simulate clouds is one of the new visual simulation technologies in Virtual Reality (VR). Taking the original data of satellite cloud images as the source, this paper depicts specifically the technology of 3D satellite cloud imaging through the transforming of coordinates and projection, creating a DEM (Digital Elevation Model) of cloud imaging and 3D simulation....

a method for deformation computation based on strain tensor elements, as an alternative to the usual way of application of gradient of displacement vector, is proposed. the method computes directly the strain tensor elements from the computed/observed changes in distances and angles between the stations of a geodetic network in two epochs of observations. displacement vector which is determined...

For a non-trivial connected graph G, a set S ⊆ V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets and any edge geodetic set of order g1(G) is an edge geodetic basis. A connected edge geodetic set of G is an edge geodetic set S such that the ...

A set S of vertices of a connected graph G is a geodetic set if every vertex of G lies on an x−y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set ofG is the geodetic number ofG, denoted by g(G). A set S of vertices of a graph G is an edge geodetic set if every edge of G lies on an x − y geodesic for some elements x and y in S. The minimum cardinality of an edge...

a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$‎. ‎a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$‎. ‎a geodetic dominating set $s$ is both a geodetic and a dominating set‎. ‎the geodetic (domination‎, ‎geodetic domination) number...