Special Classes of Coprime Irregular Graphs | Zendy

P Sankara Narayanan | Zendy; S. Saravanakumar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Special Classes of Coprime Irregular Graphs

Author(s) -

P Sankara Narayanan,

S. Saravanakumar

Publication year - 2020

Publication title -

international journal for research in engineering application and management

Language(s) - English

Resource type - Journals

ISSN - 2454-9150

DOI - 10.35291/2454-9150.2020.0404

Subject(s) - coprime integers , weighting , combinatorics , vertex (graph theory) , mathematics , graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , physics , artificial intelligence , acoustics

: An k-edge-weighting of a graph G = (V, E) is a mapping : E(G) {1, 2, 3, ...k}, where k is a positive integer. The sum of the edge-weighting appearing on the edges incident at the vertex v under the edge-weighting and is denoted by (v). An k edge-weighting of G is a coprime irregular edge-weighting if gcd ( (u), (v)) = 1 for every pair of adjacent vertices u and v in G. A graph G admits a coprime irregular edge-weighting is called a coprime irregular graph. In this paper, we discuss the coprime irregular edge-weighting for some special classes of graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research