Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
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...
—“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, ...
Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh ...
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...