A set U of vertices of a graph G is called a geodetic set if the union of all the geodesics joining pairs of points of U is the whole graph G. One result in this paper is a tight lower bound on the minimum number of vertices in a geodetic set. In order to obtain that result, the following extremal set problem is solved. Find the minimum cardinality of a collection S of subsets of 1⁄2n 1⁄4 f1; 2...

Introducing certain types of morphisms for general (abstract) convexity spaces, we give several ways for reducing the (Calder-) Eckhoff partition problem to simpler equivalent forms (finite, point-convex, interval spaces; restricted form, i.e. with distinct points). With additional results (to appear in a forthcoming paper) we show how the general problem can be reduced to its restricted versio...

Space geodetic estimates of the rate of Nazca-South America convergence and Nazca-Pacific spreading averaging over several years show that present day rates are significantly slower than the 3 million year average NUVEL-1A model. The implied rates of deceleration are consistent with longer term trends extending back to at least 20 Ma, about the time of initiation of Andes growth, and may reflec...

Let u, v ∈ V be two vertices of a connected graph G. The vertex v is said to be a boundary vertex of u if no neighbor of v is further away from u than v. The boundary of a graph is the set of all its boundary vertices. In this work, we present a number of properties of the boundary of a graph under different points of view: (1) a realization theorem involving different types of boundary vertex ...

This paper analyzes the edge-reflection problem of obliquely incident guided waves in a plate. The generalized guided-wave theories in a plate, including the orthogonality of modes and the mode-decomposition method are summarized. The edge-reflection problem is solved on the basis of the mode-decomposition method. Some numerical results are presented and compared to experimental results. [doi:1...

Coupling methods for continuum models with molecular models are developed. Two methods are studied here: an overlapping domain decomposition method, which has overlapping domain, and an edge-to-edge decomposition method, which has an interface between two models. These two methods enforce the compatibility on the overlapping domain or interface nodes/atoms by the Lagrange multiplier method or t...

Let $G$ be a finite group and $pi(G)$ be the set of all prime divisors of $|G|$. The prime graph of $G$ is a simple graph $Gamma(G)$ with vertex set $pi(G)$ and two distinct vertices $p$ and $q$ in $pi(G)$ are adjacent by an edge if an only if $G$ has an element of order $pq$. In this case, we write $psim q$. Let $|G= p_1^{alpha_1}cdot p_2^{alpha_2}cdots p_k^{alpha_k}$, where $p_1

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.