Further Results on (a, d) -total Edge Irregularity Strength of Graphs
Consider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight of . The total edge irregularity strength of...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Science for Women, University of Baghdad
2023-12-01
|
| Series: | Baghdad Science Journal |
| Subjects: | |
| Online Access: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8545 |
| Summary: | Consider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by and is the least for which G admits edge irregular h-labeling. In this article, for some common graph families are examined. In addition, an open problem is solved affirmatively.
|
|---|---|
| ISSN: | 2078-8665 2411-7986 |