Let ‘G’ be a graph. If u,v ∈V, then u-v geodetic of G is the shortest path between u and v. The closed interval I[u, v] consists all vertices lying in some G. For S⊆V(G) set I[S] union sets I [u, for u,v∈S. A S if I[S]=V(G). cardinality minimum number G, denoted by g(G). graph split 〈V-S〉 disconnected, g_s (G) In this paper study restrained strong product lexicographic graphs. subgraph disconne...

Forest fragmentation results in a loss of forest interior and an increase in edge habitat. We studied how understorey bird community composition and habitat variables changed along an edge-to-interior gradient in a 1248-ha lowland rainforest patch in peninsular Malaysia. Birds and environmental variables such as vegetation structure and litter depth were detected within a 25-m radius of each of...

W e 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 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 equidecompos...

A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is ...

Updating maps is a process where the main goal is to bring the content of spatial databases in their electronic and hardcopy versions up to the most current state. The three main tasks undertaken in updating maps are change detection, image interpretation, and metadata and geographic correction (i.e., georeferencing). However, an analysis of map update technology shows that the most time consum...

Tropospheric tomography using data from local networks of Global Positioning System (GPS) receivers is producing encouraging spatio-temporal representations of the wet refractivity field. In this work we present the results from a small-scale geodetic experiment that we carried out at the Onsala Space Observatory. Seven GPS receivers distributed within a radius of 3 km from the center, were dep...

This contribution reviews a few basic concepts of optimization and design of a geodetic network. Proper assessment and analysis of networks is an important task in many geodetic-surveying projects. Appropriate quality-control measures should be defined, and an optimal design should be sought. The quality of a geodetic network is characterized by precision, reliability, and cost. The aim is to p...

This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a result, the enumeration of the class of geodetic graphs homeomorphic to certain Moore graphs has been performed.

Modern geodetic observations from a wide range of space and terrestrial technologies contribute to our knowledge of the solid Earth, atmosphere, ocean, cryosphere, and land water storage. These geodetic observations record the “fingerprints” of global change processes and thus are a crucial independent source of high accuracy information for many global change studies. Many of the geodetic tech...