For any graph G = (V, E), D  V is a global dominating set if D dominates both G and its complement G . The global domination number g(G) of a graph G is the fewest number of vertices required of a global dominating set. In general, max{(G), (G )} ≤ g(G) ≤ (G)+(G ), where (G) and (G ) are the respective domination numbers of G and G . We show, when G is a planar graph, that g(G) ≤ max{...

A cactus graph is a connected graph in which any two cycles have at most one vertex in common. Let γ(G) and γc(G) be the domination number and connected domination number of a graph G, respectively. We can see that γ(G) ≤ γc(G) for any graph G. S. Arumugam and J. Paulraj Joseph [1] have characterized trees, unicyclic graphs and cubic graphs with equal domination and connected domination numbers...

Optimality Theory (OT) and Harmonic Grammar (HG) differ because the former assumes a model of constraint interaction based on strict domination, while the latter assumes a weighted model of interaction. As Prince and Smolensky (1997) admit, “that strict domination governs grammatical constraint interaction is not currently explained”. Yet, Legendre et al. (2006, 911-912) make two suggestions. T...

The paper points out that the relatively slow development of RMB as a reserve currency is taking place in parallel with expansion trade invoiced renminbi. It argued that, even absence financial liberalization, renminbi could still become global currency. Namely, leading status world creates potential for creating demand and supply Additionally, same direction working an increase number central ...