Inverse problems for the number of maximal independent sets

Details Inverse problems for the number of maximal independent sets Inverse problems for the number of maximal independent sets

2011-11-18

arxiv.org/abs/1111.4442v1

Mathematics

Combinatorics

1 figure, 8 pages

Scientific paper

We study the following inverse graph-theoretic problem: how many vertices
should a graph have given that it has a specified value of some parameter. We
obtain asymptotic for the minimal number of vertices of the graph with the
given number $n$ of maximal independent sets for a class of natural numbers
that can be represented as concatenation of periodic binary words.

Affiliated with

Also associated with

No associations

Rating

Inverse problems for the number of maximal independent sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inverse problems for the number of maximal independent sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inverse problems for the number of maximal independent sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-550005