Coprime Irregular Graphs
S. Saravana Kumar
S. Saravana Kumar, Department of Mathematics, Kalasalingam Academy of Research and Education College, Krishnankoil (Tamil Nadu), India.
Manuscript received on 25 November 2019 | Revised Manuscript received on 19 December 2019 | Manuscript Published on 30 December 2019 | PP: 1093-1096 | Volume-9 Issue-1S4 December 2019 | Retrieval Number: A12071291S419/19©BEIESP | DOI: 10.35940/ijeat.A1207.1291S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: An l-edge-weighting of a graph G is a map : E(G) {1, 2, 3, … l}, where l is a positive integer. For a vertex v V(G), the weight (v) is the sum of edge-weights appearing on the edges incident at v under the edge-weighting . An l-edge-weighting of G is coprime irregular edge-weighting of G if gcd( (u), (v)) = 1 for every pair of adjacent vertices u and v in G. A graph G is coprime irregular if G admits a coprime irregular edge-weighting. In this paper, we discuss this new irregular edge weighting of graphs.
Keywords: Coprime, Edge-Weighting.
Scope of the Article: Cryptography and Applied Mathematics