Show simple item record

dc.contributor.authorÇalışkan, Cafer
dc.date.accessioned2019-06-27T08:01:43Z
dc.date.available2019-06-27T08:01:43Z
dc.date.issued2016
dc.identifier.issn1063-8539
dc.identifier.issn1520-6610
dc.identifier.urihttps://hdl.handle.net/20.500.12469/452
dc.identifier.urihttps://doi.org/10.1002/jcd.21433
dc.description.abstractLet 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.
dc.language.isoEnglish
dc.publisherWiley-Blackwell
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectGraphical t-Designs
dc.subjectt-Edge-Balanced Graphs
dc.titleNew 2-Edge-Balanced Graphs from Bipartite Graphs
dc.typeArticle
dc.identifier.startpage343
dc.identifier.endpage351
dc.relation.journalJournal Of Combinatorial Designs
dc.identifier.issue8
dc.identifier.volume24
dc.identifier.wosWOS:000379978400001
dc.identifier.doi10.1002/jcd.21433
dc.contributor.khasauthorÇalışkan, Cafer


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record