New Infinite Families of 2-Edge-Balanced Graphs

Simple item page
dc.contributor.authorÇalışkan, Cafer
dc.contributor.authorChee, Yeow Meng
dc.date.accessioned2019-06-27T08:02:55Z
dc.date.available2019-06-27T08:02:55Z
dc.date.issued2014
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.description.abstractA 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.identifier.citation1
dc.identifier.doi10.1002/jcd.21367en_US
dc.identifier.endpage305
dc.identifier.issn1063-8539en_US
dc.identifier.issn1520-6610en_US
dc.identifier.issn1063-8539
dc.identifier.issn1520-6610
dc.identifier.issue7
dc.identifier.scopus2-s2.0-84899410752en_US
dc.identifier.scopusqualityQ1
dc.identifier.startpage291en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12469/709
dc.identifier.urihttps://doi.org/10.1002/jcd.21367
dc.identifier.volume22en_US
dc.identifier.wosWOS:000334394800002en_US
dc.identifier.wosqualityQ4
dc.institutionauthorÇalışkan, Caferen_US
dc.language.isoenen_US
dc.publisherWiley-Blackwellen_US
dc.relation.journalJournal of Combinatorial Designsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectGraphical t-designsen_US
dc.subjectT-edge-balanced graphsen_US
dc.titleNew Infinite Families of 2-Edge-Balanced Graphsen_US
dc.typeArticleen_US
dspace.entity.typePublication

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
New Infinite Families of 2‐Edge‐Balanced Graphs.pdf
Size:
273.71 KB
Format:
Adobe Portable Document Format
Description:
Download

Collections

WoS İndeksli Yayınlar Koleksiyonu
Bilgisayar Mühendisliği Bölümü Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu