On reflexive edge strength of generalized prism graphs
| Main Authors: | Irfan, Muhammad; University of Okara, Okara, Pakistan, Baca, Martin; Department of Applied Mathematics and Informatics, Technical University, Ko\v{s}ice, Slovak Republic, Semanicova-Fenovcikova, Andrea; Department of Applied Mathematics and Informatics, Technical University, Ko\v{s}ice, Slovak Republic |
|---|---|
| Other Authors: | Slovak Science and Technology Assistance Agency under the contract No. APVV-15-0116. |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2022
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/472 https://www.ejgta.org/index.php/ejgta/article/view/472/pdf_231 |
Daftar Isi:
- Let G be a connected, simple and undirected graph. The assignments {0, 2, ..., 2kv} to the vertices and {1, 2, ..., ke} to the edges of graph G are called total k-labelings, where k = max{ke, 2kv}. The total k-labeling is called an reflexive edge irregular k-labeling of the graph G, if for every two different edges xy and x′y′ of G, one haswt(xy)=fv(x)+fe(xy)+fv(y)≠wt(x′y′) = fv(x′) + fe(x′y′) + fv(y′).The minimum k for which the graph G has an reflexive edge irregular k-labeling is called the reflexive edge strength of G. In this paper we investigate the exact value of reflexive edge strength for generalized prism graphs.