646 search results - page 18 / 130 » Generalized connected domination in graphs |
ICPP
1995
IEEE
14 years 6 days ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
ICMCS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
LMCS
2006
13 years 8 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
ESA
1999
Springer
14 years 28 days ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
ENDM
2007
13 years 8 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...