Login / Signup

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.

David AugerIrène CharonIiro S. HonkalaOlivier HudryAntoine Lobstein
Published in: Adv. Math. Commun. (2009)
Keyphrases
  • small number
  • maximum independent set
  • computational complexity
  • graph theory
  • undirected graph
  • random graphs
  • maximum distance
  • neural network
  • genetic algorithm