Login / Signup

On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7.

Rommel M. BarbosaMárcia R. CappelleDieter Rautenbach
Published in: Discret. Math. (2013)
Keyphrases
  • spanning tree
  • graph matching
  • random graphs
  • independent set
  • genetic algorithm
  • graph theory
  • series parallel
  • social network analysis
  • graph representation
  • power law
  • connected dominating set