| dc.contributor.author | Çalışkan, Cafer | |
| dc.contributor.author | Chee, Yeow Meng | |
| dc.date.accessioned | 2019-06-27T08:02:55Z | |
| dc.date.available | 2019-06-27T08:02:55Z | |
| dc.date.issued | 2014 | |
| dc.identifier.issn | 1063-8539 | en_US |
| dc.identifier.issn | 1520-6610 | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.12469/709 | |
| dc.identifier.uri | https://doi.org/10.1002/jcd.21367 | |
| dc.description.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 Kn isomorphic to G. We call the index of G. In this article we obtain new infinite families of 2-edge-balanced graphs. | 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 Infinite Families of 2-Edge-Balanced Graphs | en_US |
| dc.type | article | en_US |
| dc.identifier.startpage | 291 | en_US |
| dc.identifier.endpage | 305 | |
| dc.relation.journal | Journal of Combinatorial Designs | en_US |
| dc.identifier.issue | 7 | |
| dc.identifier.volume | 22 | 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:000334394800002 | en_US |
| dc.identifier.doi | 10.1002/jcd.21367 | en_US |
| dc.identifier.scopus | 2-s2.0-84899410752 | en_US |
| dc.institutionauthor | Çalışkan, Cafer | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
