On Edge Pair Sum Labeling of Graphs
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 7, Issue 2
Abstract
An injective map f : E(G) → {±1,±2,…,±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f^*:V(G)→Z-{0} defined by f^* (v)=∑_(e∊E_v)▒f(e) is one – one, where E_v denotes the set of edges in G that are incident with a vertex v and f^* (V(G)) is either of the form {±k_1,±k_2,…,±k_(p/2) } or {±k_1,±k_2,…,〖±k〗_((p-1)/2) }⋃{k_(p/2) } according as p is even or odd. A graph which admits edge pair sum labeling is called an edge pair sum graph. In this paper we prove that some cycle related graphs are edge pair sum graphs.
Authors and Affiliations
P. Jeyanthi , T. Saratha Devi
Keywords
Related Articles
- EP ID EP115959
- DOI -
- Views 83
- Downloads 0
Teachers’ Perception of the new Nine-Year Basic Education Mathematics Curriculum in Nigeria
The study investigated the perception of primary and junior secondary mathematics teachers on the new nine-year basic education mathematics curriculum in Nigeria. A descriptive survey design was adopted for the stu...
Suitable mode of Public Transport – A Decision making model using Possibility Intuitionistic Fuzzy Soft Sets
In this paper, the concept of Possibility Intuitionistic Fuzzy Soft Sets is used to develop a decision making model for choosing a suitable mode of transport.
On (M,Q,G*)-Open Functions in M-Structures
The purpose of this paper is to give a new type of open function and closed function called (M,Q,G*)-open function and (M,Q,G*)-closed function. Also, we obtain its characterizations and its basic properties
The Discrete Logarithm Problem in the ElGamal Cryptosystem over the Abelian Group U(n) Where n= pm,or 2pm
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms pm, or 2pm where p is an odd large prime and m is a positive integer...
SOME RESULTS ON KRONECKER PRODUCT OF TWO GRAPHS
We consider product graphs and recall the results associated to the product graphs. Paul M.Weichsel [3] defined the Kronecker product of graphs. He has proved a characterization for the product graphs to be connect...