SPECIAL KINDS OF GRAPHS - EDGE PRODUCT NUMBER
##plugins.themes.bootstrap3.article.main##
##plugins.themes.bootstrap3.article.sidebar##
Abstract
A graph G(V, E) is said to be a sum graph if there exists a bijective labeling from the vertex set V to a set S of positive integers such that xy ∈ E if and only if f(x) + f(y) ∈ S. We introduce the edge as well as the product analogue of sum graphs. The edge product number of a graph G is the minimum number r so that G∪rK2 becomes an edge product graph. In this paper we define some different kinds of graphs and also investigate the edge product number of that graphs.Â
How to Cite
##plugins.themes.bootstrap3.article.details##
COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY
Â
All paper submissions must carry the following duly signed by all the authors:
“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.â€