Repository logoGCRIS
  • English
  • Türkçe
  • Русский
Log In
New user? Click here to register. Have you forgotten your password?
Home
Communities
Browse GCRIS
Overview
GCRIS Guide
  1. Home
  2. Browse by Author

Browsing by Author "Anum,"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Article
    On Edge Irregularity Strength of Different Families of Graphs
    (Universidad Catolica del Norte, 2023) Imran, M.; Cancan, M.; Ali, Y.; Anum,; Aslam, J.
    Edge irregular mapping or vertex mapping h: V (G) −→ {1, 2, 3, …, s} is a mapping of vertices in such a way that all edges have distinct weights. We evaluate weight of any edge by using equation wth(cd) = h(c) + h(d), ∀c, d ∈ V (G) and ∀cd ∈ E(G). Edge irregularity strength denoted by es(G) is a minimum positive integer used to label vertices to form edge irregular labeling. In this paper, we find exact value of edge irregularity strength of linear phenylene graph PHn, Bn graph and different families of snake graph. © (2023), (SciELO-Scientific Electronic Library Online). All Rights Reserved.
Repository logo
Collections
  • Scopus Collection
  • WoS Collection
  • TrDizin Collection
  • PubMed Collection
About
  • Contact
  • GCRIS
  • Research Ecosystems
  • Feedback
  • OAI-PMH

Powered by Research Ecosystems

  • Privacy policy
  • End User Agreement
  • Feedback