Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Ashok Gupta
College of Computer Science & Information Systems, Jazan University, Jazan, Saudi Arabia
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Computing the edge irregularity strengths of chain graphs and the join of two graphs Ali Ahmad; Ashok Gupta; Rinovia Simanjuntak
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 6, No 1 (2018): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2018.6.1.15

Abstract

In computer science, graphs are used in variety of applications directly or indirectly. Especially quantitative labeled graphs have played a vital role in computational linguistics, decision making software tools, coding theory and path determination in networks. For a graph G(V, E) with the vertex set V and the edge set E, a vertex k-labeling ϕ : V → {1, 2, …, k} is defined to be an edge irregular k-labeling of the graph G if for every two different edges e and f their wϕ(e) ≠ wϕ(f), where the weight of an edge e = xy ∈ E(G) is wϕ(xy) = ϕ(x) + ϕ(y). The minimum k for which the graph G has an edge irregular k-labeling is called the edge irregularity strength of G, denoted by es(G). In this paper, we determine the edge irregularity strengths of some chain graphs and the join of two graphs. We introduce a conjecture and open problems for researchers for further research.
Co-Authors Ali Ahmad Rinovia Simanjuntak