Çalışkan, Cafer2019-06-272019-06-27201601063-85391520-66101063-85391520-6610https://hdl.handle.net/20.500.12469/452https://doi.org/10.1002/jcd.21433Let G be a graph of order n satisfying that there exists lambda epsilon Z(+) for which every graph of order n and size t is contained in exactly. distinct subgraphs of the complete graph K-n isomorphic to G. Then G is called t-edge-balanced and. the index of G. In this article new examples of 2-edge-balanced graphs are constructed from bipartite graphs and some further methods are introduced to obtain more from old. (C) 2015 Wiley Periodicals Inc.eninfo:eu-repo/semantics/openAccessGraphical t-Designst-Edge-Balanced GraphsArticle343351824WOS:00037997840000110.1002/jcd.214332-s2.0-84977510109Q4Q1