Skip to main content
SpringerLink
Log in

The second largest number of maximal independent sets in connected graphs with at most one cycle

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

A maximal independent set is an independent set that is not a proper subset of any other independent set. In this paper, we determine the second largest number of maximal independent sets among all graphs (respectively, connected graphs) of order n≥4 with at most one cycle. We also characterize those extremal graphs achieving these values.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alzoubi K, Wan P-J, Frieder O (2003) Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks. Int J Found Comput Sci 14(2):287–303

    Article  MathSciNet  MATH  Google Scholar 

  • Basagni S (1999) A distributed algorithm for finding a maximal weighted independent set in wireless networks. In: Proceedings of the 11th IASTED international conference on parallel and distributed computing and systems (PDCS), pp 517–522

    Google Scholar 

  • El-Basil S (1988) Binomial-combinatorial properties of Clar structures. Discrete Appl Math 19(1–3):145–156

    Article  MathSciNet  MATH  Google Scholar 

  • Hujter M, Tuza Z (1993) The number of maximal independent sets in triangle-free graphs. SIAM J Discrete Math 6:284–288

    Article  MathSciNet  MATH  Google Scholar 

  • Jin Z, Li X (2008) Graphs with the second largest number of maximal independent sets. Discrete Math 308:5864–5870

    Article  MathSciNet  MATH  Google Scholar 

  • Jou MJ, Chang GJ (1995) Survey on counting maximal independent sets. In: Tangmance S, Schulz E (eds) Proceedings of the second Asian mathematical conference. World Scientific, Singapore, pp 265–275

    Google Scholar 

  • Jou MJ, Chang GJ (1997) Maximal independent sets in graphs with at most one cycle. Discrete Appl Math 79:67–73

    Article  MathSciNet  MATH  Google Scholar 

  • Jou MJ, Chang GJ (2002) Algorithmic aspects of counting independent sets. Ars Comb 65:265–277

    MathSciNet  MATH  Google Scholar 

  • Jou M-J, Lin J-J (2009) Trees with the second largest number of maximal independent sets. Discrete Math 309:4469–4474

    Article  MathSciNet  MATH  Google Scholar 

  • Knopfmacher A, Tichy RF, Wagner S, Ziegler V (2007) Graphs, partitions and Fibonacci numbers. Discrete Appl Math 155:1175–1187

    Article  MathSciNet  MATH  Google Scholar 

  • Moon JW, Moser L (1965) On cliques in graphs. Isr J Math 3:23–28

    Article  MathSciNet  MATH  Google Scholar 

  • Moscibroda T, Wattenhofer R (2004) Efficient computation of maximal independent sets in unstructured multi-hop radio networks. In: Proc of 1-st international conference on mobile ad hoc and sensor systems, pp 51–59

    Google Scholar 

  • Rhodes N, Willett P, Calvet A, Dunbar JB, Humblet C (2003) CLIP: similarity searching of 3D databases using clique detection. J Chem Inf Comput Sci 43(2):443–448

    Article  Google Scholar 

  • Prodinger H, Tichy RF (1982) Fibonacci numbers of graphs. Fibonacci Q 20:16–21

    MathSciNet  MATH  Google Scholar 

  • Wagner SG (2006) The Fibonacci number of generalized Petersen graphs. Fibonacci Q 44:362–367

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ling Tung University, Taichung, 40852, Taiwan

    Min-Jen Jou

Authors
  1. Min-Jen Jou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Min-Jen Jou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jou, MJ. The second largest number of maximal independent sets in connected graphs with at most one cycle. J Comb Optim 24, 192–201 (2012). https://doi.org/10.1007/s10878-011-9376-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-011-9376-4

Keywords

Search

Navigation