Dominating set of G
-
A set D of vertices in a graph G(V, E) is a dominating set of G, if every vertex of V not in D is adjacent to at least one vertex in D. A dominating set D of G(V, E)is a k – fair dominating set of G, for
6p 
lucastanguyen
01-06-2020
5
1
Download
-
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to n 900.A partition of weight n is a nonincreasing sequence of nonnegative integers (1, 2, . . . , k, . . .) whose sum is n. The weight is denoted by ||. The number of nonzero elements in the sequence is the length of the partition denoted by l(). The set of all partitions of weight n is denoted by P(n).
17p thulanh5
12-09-2011
53
4
Download
