New Infinite Families of 2‐Edge‐Balanced Graphs
Cafer Çalışkan, Yeow Meng Chee · Journal of Combinatorial Designs · 2013
Abstract 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 isomorphic to G. We call λ the index of G. In this article, we obtain new infinite families of 2‐edge‐balanced graphs.