

A212628


Number of maximal independent vertex subsets in the rooted tree with MatulaGoebel number n.


11



1, 2, 2, 2, 3, 3, 2, 2, 4, 4, 4, 3, 3, 3, 5, 2, 3, 5, 2, 4, 4, 5, 5, 3, 7, 5, 8, 3, 4, 6, 5, 2, 7, 4, 5, 5, 3, 3, 6, 4, 5, 5, 3, 5, 9, 8, 6, 3, 4, 8, 5, 5, 2, 9, 9, 3, 4, 6, 4, 6, 5, 7, 8, 2, 8, 8, 3, 4, 9, 6, 4, 5, 5, 5, 11, 3, 7, 8, 5, 4, 16, 6, 8, 5, 7, 5, 8, 5, 3, 10, 6, 8, 9, 9, 5, 3, 8, 5, 13, 8, 5, 6, 9, 5, 9, 3, 3, 9, 6, 10, 6, 3, 6, 5, 13, 6, 12, 5, 5, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

A vertex subset in a tree is said to be independent if no pair of vertices is connected by an edge. The empty set is considered to be independent. An independent vertex subset S of a tree is said to be maximal if every vertex that is not in S is joined by an edge to at least one vertex of S.
The MatulaGoebel number of a rooted tree can be defined in the following recursive manner: to the onevertex tree there corresponds the number 1; to a tree T with root degree 1 there corresponds the tth prime number, where t is the MatulaGoebel number of the tree obtained from T by deleting the edge emanating from the root; to a tree T with root degree m>=2 there corresponds the product of the MatulaGoebel numbers of the m branches of T.
Let A(n)=A(n,x), B(n)=B(n,x), C(n)=C(n,x) be the generating polynomial with respect to size of the maximal independent sets that contain the root, the maximal independent sets that do not contain the root, and the independent sets which are not maximal but become maximal if the root is removed, respectively. We have A(1)=x, B(1)=0, C(1)=1, A(tth prime) = x[B(t) + C(t)], B(tth prime) = A(t), C(tth prime)=B(t), A(rs)=A(r)A(s)/x, B(rs)=B(r)B(s)+B(r)C(s)+B(s)C(r), C(rs)=C(r)C(s) (r,s>=2). The generating polynomial of the maximal independent vertex subsets with respect to size is P(n, x)=A(n,x)+B(n,x). Then a(n) = P(1,n). The Maple program is based on these relations.


LINKS

Table of n, a(n) for n=1..120.
É. Czabarka, L. Székely, and S. Wagner, The inverse problem for certain tree parameters, Discrete Appl. Math., 157, 2009, 33143319.
E. Deutsch, Rooted tree statistics from Matula numbers, arXiv:1111.4288 [math.CO], 2011.
F. Goebel, On a 11correspondence between rooted trees and natural numbers, J. Combin. Theory, B 29 (1980), 141143.
I. Gutman and A. Ivic, On Matula numbers, Discrete Math., 150, 1996, 131142.
I. Gutman and YeongNan Yeh, Deducing properties of trees from their Matula numbers, Publ. Inst. Math., 53 (67), 1993, 1722
D. Matula, A natural rooted tree enumeration by prime factorization, SIAM Rev. 10 (1968) 273.
H. S. Wilf, The number of maximal independent sets in a tree, SIAM J. Alg. Disc. Math., 7, 1986, 125130.
Index entries for sequences related to MatulaGoebel numbers


FORMULA

a(n) = Sum_{k>=1} A212627(n,k).


EXAMPLE

a(11)=4 because the rooted tree with MatulaGoebel number 11 is the path tree on 5 vertices R  A  B  C  D; the maximal independent vertex subsets are {R,C}, {A,C}, {A,D}, and {R,B,D}.


MAPLE

with(numtheory): P := proc (n) local r, s, A, B, C: r := n > op(1, factorset(n)): s := n > n/r(n): A := proc (n) if n = 1 then x elif bigomega(n) = 1 then x*(B(pi(n))+C(pi(n))) else A(r(n))*A(s(n))/x end if end proc: B := proc (n) if n = 1 then 0 elif bigomega(n) = 1 then A(pi(n)) else sort(expand(B(r(n))*B(s(n))+B(r(n))*C(s(n))+B(s(n))*C(r(n)))) end if end proc: C := proc (n) if n = 1 then 1 elif bigomega(n) = 1 then B(pi(n)) else expand(C(r(n))*C(s(n))) end if end proc: if n = 1 then x else sort(expand(A(n)+B(n))) end if end proc: seq(subs(x = 1, P(n)), n = 1 .. 120);
# For a more efficient calculation, the procedure P() could easily be simplified and optimized to yield A212628(n): remove "sort(expand...)" and replace x with 1 in appropriate places.  M. F. Hasler, Jan 06 2013


CROSSREFS

Cf. A212627.
See also A212618, A212619, A212620, A212621, A212622, A212623, A212624, A212625, A212626, A212629, A212630, A212631, A212632 and A206483A206499.
Sequence in context: A098014 A059957 A165924 * A272851 A242258 A232615
Adjacent sequences: A212625 A212626 A212627 * A212629 A212630 A212631


KEYWORD

nonn,changed


AUTHOR

Emeric Deutsch, Jun 08 2012


STATUS

approved



