38,219 research outputs found
On global location-domination in graphs
A dominating set of a graph is called locating-dominating, LD-set for
short, if every vertex not in is uniquely determined by the set of
neighbors of belonging to . Locating-dominating sets of minimum
cardinality are called -codes and the cardinality of an LD-code is the
location-domination number . An LD-set of a graph is global
if it is an LD-set of both and its complement . The global
location-domination number is the minimum cardinality of a
global LD-set of . In this work, we give some relations between
locating-dominating sets and the location-domination number in a graph and its
complement.Comment: 15 pages: 2 tables; 8 figures; 20 reference
The domination number of on-line social networks and random geometric graphs
We consider the domination number for on-line social networks, both in a
stochastic network model, and for real-world, networked data. Asymptotic
sublinear bounds are rigorously derived for the domination number of graphs
generated by the memoryless geometric protean random graph model. We establish
sublinear bounds for the domination number of graphs in the Facebook 100 data
set, and these bounds are well-correlated with those predicted by the
stochastic model. In addition, we derive the asymptotic value of the domination
number in classical random geometric graphs
- …