Premium
New 2 ‐Edge‐Balanced Graphs from Bipartite Graphs
Author(s) -
Caliskan Cafer
Publication year - 2016
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21433
Subject(s) - combinatorics , mathematics , bipartite graph , cograph , pathwidth , pancyclic graph , 1 planar graph , discrete mathematics , graph , chordal graph , indifference graph , complete bipartite graph , line graph
Let G be a graph of order n satisfying that there exists λ ∈ 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.