Open AccessOn Equitable Irregular Graphs
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d1044.1284s419
Subject(s) - weighting , combinatorics , vertex (graph theory) , graph , mathematics , enhanced data rates for gsm evolution , integer (computer science) , discrete mathematics , computer science , physics , artificial intelligence , acoustics , programming language
An k−edge-weighting of a graph G = (V,E) is a map : () → {,,, . . . }, }where ≥ is an integer. Denote () is the sum of edge-weights appearing on the edges incident at the vertex v under . An k-edge -weighting of G is equitable irregular if |() − ()| ≤ , for every pair of adjacent vertices u and v in G. The equitable irregular strength () of an equitable irregular graph G is the smallest positive integer k such that there is a k-edge weighting of G. In this paper, we discuss the equitable irregular edge-weighting for some classes of graphs