646 search results - page 34 / 130 » Generalized connected domination in graphs |
DAM
2010
13 years 8 months ago
2010
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
JCT
2007
13 years 8 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
AAAI
2007
13 years 11 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
ESA
1997
Springer
14 years 26 days ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...