Since the definition of the Geocentric Datum of Australia in 1994 (GDA94), Australia has had a GPS continuously operating reference station (CORS) network for datum maintenance. The Australian Fiducial Network (AFN) now comprises eight geologically stable, geodetic quality GNSS CORS stations which also contribute to the Australian Regional Geodetic Network and the International GNSS Network. In...

Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...

In our standard geodetic VLBI solutions, we estimate the positions of quasars assuming that their positions do not vary in time. However, in solutions estimating proper motion, a significant number of quasars show apparent proper motion greater than 50 μas/yr. For individual quasars, there are source structure effects that cause apparent proper motion. To examine how coherent the pattern of app...

In the paper four semirings for solving social networks problems are constructed. The closures of the matrix of a given signed graph over balance and cluster semirings can be used to decide whether the graph is balanced or clusterable. The closure of relational matrix over geodetic semiring contains for every pair of vertices and the length and the number of geodesics; and for geosetic semiring...

An edge geodetic set of a connected graph G of order p ≥ 2 is a set S ⊆ V (G) such that 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 cardinality of its edge geodetic sets and any edge geodetic set of cardinality g1(G) is a minimum edge geodetic set of G or an edge geodetic basis of G. An edge geodetic set S in ...