231 search results - page 11 / 47 » The Number of Independent Sets in a Regular Graph |
JGT
2010
14 years 8 months ago
2010
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
JGAA
2006
14 years 9 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
TIT
2011
14 years 4 months ago
2011
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
82
Voted
TAGT
1994
Springer
15 years 1 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
75
Voted
COMBINATORICS
2004
14 years 9 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...