• English
    • Türkçe
  • English 
    • English
    • Türkçe
  • Login
View Item 
  •   DSpace Home
  • Araştırma Çıktıları / WOS
  • Araştırma Çıktıları / WOS
  • View Item
  •   DSpace Home
  • Araştırma Çıktıları / WOS
  • Araştırma Çıktıları / WOS
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

New 2-Edge-Balanced Graphs from Bipartite Graphs

Thumbnail
View/Open
New 2-Edge-Balanced Graphs from Bipartite Graphs.pdf (345.9Kb)
Date
2016
Author
Çalışkan, Cafer
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.

Source

Journal Of Combinatorial Designs

Issue

8

Volume

24

Pages

343-351

URI

https://hdl.handle.net/20.500.12469/452
https://doi.org/10.1002/jcd.21433

Collections

  • Araştırma Çıktıları / Scopus [1565]
  • Araştırma Çıktıları / WOS [1518]
  • Bilgisayar Mühendisliği / Computer Engineering [188]

Keywords

Graphical t-Designs
t-Edge-Balanced Graphs

Share


DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
Theme by 
@mire NV
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateBy AuthorsBy TitlesBy SubjectsBy TypesBy LanguagesBy DepartmentsBy PublishersBy KHAS AuthorsBy Access TypesThis CollectionBy Issue DateBy AuthorsBy TitlesBy SubjectsBy TypesBy LanguagesBy DepartmentsBy PublishersBy KHAS AuthorsBy Access Types

My Account

LoginRegister

Statistics

View Google Analytics Statistics

DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
Theme by 
@mire NV