Fibonacci Index and Stability Number of Graphs: a Polyhedral Study

Details Fibonacci Index and Stability Number of Graphs: a Polyhedral Study Fibonacci Index and Stability Number of Graphs: a Polyhedral Study

2008-11-10

arxiv.org/abs/0811.1449v1

Computer Science

Discrete Mathematics

Scientific paper

The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and the order of general graphs and connected graphs. Tur\'an graphs frequently appear in extremal graph theory. We show that Tur\'an graphs and a connected variant of them are also extremal for these particular problems. We also make a polyhedral study by establishing all the optimal linear inequalities for the stability number and the Fibonacci index, inside the classes of general and connected graphs of order $n$.

Affiliated with

Also associated with

No associations

Rating

Fibonacci Index and Stability Number of Graphs: a Polyhedral Study 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 Fibonacci Index and Stability Number of Graphs: a Polyhedral Study, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fibonacci Index and Stability Number of Graphs: a Polyhedral Study will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-724685