Kp,q Graph - Edge Product Number

Authors

  • J. P. Thavamani Associate Professor, Department of Mathematics, M.E.S. College, Nedumkandam, India

DOI:

https://doi.org/10.53555/ms.v2i3.502

Keywords:

: edge product function, edge product graph, edge product number of a graph

Abstract

A graph G is said to be an edge product graph if there exists an edge function f: E  P such that the function f and its corresponding edge product function F on V satisfies that F(v)∈P for every v∈V and if e1, e2, …,ep∈E such that f(e1). f(e2).…. f(ep)∈P then the edges e1, e2, …,ep are incident on a vertex. In this paper the edge product number of complete bipartite graph is found.

Downloads

Download data is not yet available.

References

F. Harary, Graph Theory, Addison - Wesley, Reading, 1969

F. Harary, Sum graphs over all the integers, Discrete Math., 124 (1994) 99-105

A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16 (2000) 39-48

Downloads

Published

2016-03-31

How to Cite

Thavamani, J. P. (2016). Kp,q Graph - Edge Product Number. International Journal For Research In Mathematics And Statistics, 2(3), 19–22. https://doi.org/10.53555/ms.v2i3.502

Issue

Vol. 2 No. 3 (2016): International Journal For Research In Mathematics And Statistics

Section

Articles