An Upper Bound on the Number of Edges of a 2-Connected Graph

  • Authors:

  • Pou-Lin Wu

  • Affiliations:

  • Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA

  • Venue:
  • Combinatorics, Probability and Computing
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let G be a loopless 2-connected graph whose largest cycle has c edges, and whose largest bond has c* edges. We show that |E(G)| ≤ ½cc*.