803 search results - page 65 / 161 » Independence in Direct-Product Graphs |
146
Voted
ICDCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
89
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
111
click to vote
EJC
2008
15 years 24 days ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
101
click to vote
COMBINATORICS
2006
15 years 23 days ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...