New 2-Edge-Balanced Graphs from Bipartite Graphs

Loading...
Thumbnail Image

Date

2016

Authors

Çalışkan, Cafer

Journal Title

Journal ISSN

Volume Title

Publisher

Wiley-Blackwell

Research Projects

Organizational Units

Journal Issue

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.

Description

Keywords

Graphical t-Designs, t-Edge-Balanced Graphs

Turkish CoHE Thesis Center URL

Citation

0

WoS Q

Q4

Scopus Q

Q1

Source

Volume

24

Issue

8

Start Page

343

End Page

351