Abstract

Let G be a graph of order n satisfying that there exists for which every graph of order n and size t is contained in exactly λ distinct subgraphs of the complete graph 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call