59,851 research outputs found
Locating and Total Dominating Sets of Direct Products of Complete Graphs
A set S of vertices in a graph G = (V,E) is a metric-locating-total dominating set of G if every vertex of V is adjacent to a vertex in S and for every u ≠v in V there is a vertex x in S such that d(u,x) ≠d(v,x). The metric-location-total domination number \gamma^M_t(G) of G is the minimum cardinality of a metric-locating-total dominating set in G. For graphs G and H, the direct product G × H is the graph with vertex set V(G) × V(H) where two vertices (x,y) and (v,w) are adjacent if and only if xv in E(G) and yw in E(H). In this paper, we determine the lower bound of the metric-location-total domination number of the direct products of complete graphs. We also determine some exact values for some direct products of two complete graphs
Scaling limit for a drainage network model
We consider the two dimensional version of a drainage network model
introduced by Gangopadhyay, Roy and Sarkar, and show that the appropriately
rescaled family of its paths converges in distribution to the Brownian web. We
do so by verifying the convergence criteria proposed by Fontes, Isopi, Newman
and Ravishankar.Comment: 15 page
- …