646 search results - page 66 / 130 » Generalized connected domination in graphs |
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...