Çalışkan, CaferChee, Yeow Meng2019-06-272019-06-27201411063-85391520-66101063-85391520-6610https://hdl.handle.net/20.500.12469/709https://doi.org/10.1002/jcd.21367A 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 Kn isomorphic to G. We call the index of G. In this article we obtain new infinite families of 2-edge-balanced graphs.eninfo:eu-repo/semantics/openAccessGraphical t-designsT-edge-balanced graphsArticle291305722WOS:00033439480000210.1002/jcd.213672-s2.0-84899410752Q4Q1