More on Coprime Irregular Graphs
Sankara Narayanan
Sankara Narayanan, 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: 1014-1016 | Volume-9 Issue-1S4 December 2019 | Retrieval Number: A12181291S419/19©BEIESP | DOI: 10.35940/ijeat.A1218.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 k−edge-weighting of a graph G = (V,E) is a map φ: E(G) → {1,2,3,…k}, where k is a positive integer. Denote Sφ(v) is the sum of edge-weights presenting on the edges incident at the vertex v under the edge-weighting φ. An k−edge-weighting of G is coprime irregular edge-weighting of G if gcd(Sφ(u),Sφ(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 about coprime irregular edge-weighting for some families of graphs.
Keywords: Irregular Edge-weighting, Coprime, Corona Graphs.
Scope of the Article: Cryptography and Applied Mathematics