Contents

Ars Combinatoria

  • Research article

Tough-Maximum Graphs

S.A. Choudum1, N. Priya1
1Department of Mathematics Indian Institute of Technology, Madras Chennai – 600 036, INDIA
  • Published: 31/10/2001

Abstract

We characterize tough-maximum graphs, that is, graphs having maximum number of edges among all graphs with given number of vertices and toughness.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
S.A. Choudum, N. Priya. Tough-Maximum Graphs[J], Ars Combinatoria, Volume 061. 167-172. .