Advertisement

Journal of Combinatorial Optimization

, Volume 33, Issue 1, pp 326–332 | Cite as

Maximal independent sets in a generalisation of caterpillar graph

  • K. S. Neethi
  • Sanjeev Saxena
Article

Abstract

A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backbone to the pendant vertices are called the hairs of the caterpillar graph. Ortiz and Villanueva (Discret Appl Math 160(3): 259–266, 2012) describe an algorithm, linear in the size of the output, for finding the family of maximal independent sets in a caterpillar graph. In this paper, we propose an algorithm, again linear in the output size, for a generalised version of caterpillar graph, where at each vertex of the backbone, there can be any number of hairs of length one and at most one hair of length two.

Keywords

Maximal independent set MIS Caterpillar graphs  Generalised caterpillar graphs Generating all MIS 

References

  1. Bachmaier C, Brandenburg FJ (2004) Circle planarity of level graphs. PhD Thesis, Faculty of Mathematics and Computer Science, University of PassauGoogle Scholar
  2. El-Basil S (1987) Applications of caterpillar trees in chemistry and physics. J Math Chem 1:153–174MathSciNetCrossRefGoogle Scholar
  3. Harary F, Schwenk AJ (1973) The number of caterpillars. Discret Math 6:359–365MathSciNetCrossRefzbMATHGoogle Scholar
  4. Ortiz C, Villanueva M (2012) Maximal independent sets in caterpillar graphs. Discret Appl Math 160(3):259–266MathSciNetCrossRefzbMATHGoogle Scholar
  5. Tsukiyama S, Ide M, Ariyoshi H, Shirakawa I (1977) A new algorithm for generating all the maximal independent sets. SIAM J Comput 6(3):505–517MathSciNetCrossRefzbMATHGoogle Scholar
  6. Valiant LG (1979) The complexity of computing the permanent. Theor Comput Sci 8:189–201MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyKanpurIndia
  2. 2.Microsoft R&DBangaloreIndia

Personalised recommendations