Get access

New Infinite Families of 2-Edge-Balanced Graphs


  • Contract grant sponsor: National Research Foundation of Singapore; contract grant number: NRF-CRP2-2007-03; contract grant sponsor: Nanyang Technological University; contract grant number: M58110040.


A graph G of order n is called t-edge-balanced if G satisfies the property that there exists a positive λ for which every graph of order n and size t is contained in exactly λ distinct subgraphs of math formula isomorphic to G. We call λ the index of G. In this article, we obtain new infinite families of 2-edge-balanced graphs.