| dc.contributor.author | Çalışkan, Cafer | |
| dc.date.accessioned | 2019-06-27T08:01:43Z | |
| dc.date.available | 2019-06-27T08:01:43Z | |
| dc.date.issued | 2016 | |
| dc.identifier.issn | 1063-8539 | en_US |
| dc.identifier.issn | 1520-6610 | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.12469/452 | |
| dc.identifier.uri | https://doi.org/10.1002/jcd.21433 | |
| dc.description.abstract | Let 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. | en_US] |
| dc.language.iso | eng | en_US |
| dc.publisher | Wiley-Blackwell | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Graphical t-Designs | en_US |
| dc.subject | t-Edge-Balanced Graphs | en_US |
| dc.title | New 2-Edge-Balanced Graphs from Bipartite Graphs | en_US |
| dc.type | article | en_US |
| dc.identifier.startpage | 343 | en_US |
| dc.identifier.endpage | 351 | |
| dc.relation.journal | Journal Of Combinatorial Designs | en_US |
| dc.identifier.issue | 8 | |
| dc.identifier.volume | 24 | en_US |
| dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
| dc.identifier.wos | WOS:000379978400001 | en_US |
| dc.identifier.doi | 10.1002/jcd.21433 | en_US |
| dc.identifier.scopus | 2-s2.0-84977510109 | en_US |
| dc.institutionauthor | Çalışkan, Cafer | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
