Contents

Ars Combinatoria

  • Research article

Extremal Polygonal Cactus Chain Concerning \(k\)-independent Sets

Hong Bian1, Fuji Zhang2, Guoping Wang1, Haizheng Yu3
1School of Mathematical Sciences, Xinjiang Normal University, Urumdi, Xinjiang 830054, P-.R.China
2 Department of Mathematics, Xiamen University, Xiamen, Fujian 361005, P.R.China
3College of Mathematics and Systems Science, Xinjiang University, Urumgi, Xinjiang 830046, P.R.China
  • Published: 31/01/2011

Abstract

In this paper, we obtain the explicit recurrences of the independence polynomials of polygonal cactus chains of two classes, and show that they are the extremal polygonal cactus chains with respect to the number of independent sets.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Hong Bian, Fuji Zhang, Guoping Wang, Haizheng Yu. Extremal Polygonal Cactus Chain Concerning \(k\)-independent Sets[J], Ars Combinatoria, Volume 098. 167-172. .