Title of article
The smallest Merrifield–Simmons index of -graphs
Author/Authors
Deng، نويسنده , , Hanyuan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
320
To page
326
Abstract
The Merrifield–Simmons index of a graph is defined as the total number of its independent sets. In this paper, we show that the smallest Merrifield–Simmons index of ( n , n + 1 ) -graphs is f ( n ) + 2 f ( n − 2 ) + f ( n − 4 ) , where f ( n ) is the n th Fibonacci number, and characterize the extremal graphs.
Keywords
( n , Merrifield–Simmons index , Independent set , Fibonacci number , n + 1 ) -graph
Journal title
Mathematical and Computer Modelling
Serial Year
2009
Journal title
Mathematical and Computer Modelling
Record number
1595965
Link To Document