Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kooi Kuan Yoong"'
Autor:
Kooi Kuan Yoong1 kooikuan.yoong@gmail.com, Hasni, Roslan1 hroslan@umt.edu.my, Gee Choon Lau2 geeclau@yahoo.com, Ahmad, Ali3 ahmadsms@gmail.com
Publikováno v:
Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 3, p509-526. 18p.
Publikováno v:
AIMS Mathematics, Vol 7, Iss 7, Pp 11784-11800 (2022)
For a graph $ G $, we define a total $ k $-labeling $ \varphi $ is a combination of an edge labeling $ \varphi_e(x)\to\{1, 2, \ldots, k_e\} $ and a vertex labeling $ \varphi_v(x) \to \{0, 2, \ldots, 2k_v\} $, such that $ \varphi(x) = \varphi_v(x) $ i
Externí odkaz:
https://doaj.org/article/a0df1e3a4592412b9255d87f840d858b
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 53-59 (2021)
We define a total k-labeling of a graph G as a combination of an edge labeling and a vertex labeling such that if and if where The total k-labeling is called an edge irregular reflexive k-labeling of G if every two different edges has distinct edge w
Externí odkaz:
https://doaj.org/article/559a2064fb13498ea3e88b7e48571011
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 53-59 (2021)
We define a total k-labeling of a graph G as a combination of an edge labeling and a vertex labeling such that if and if where The total k-labeling is called an edge irregular reflexive k-labeling of G if every two different edges has distinct edge w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::015c0214bdd6ef0c7c329d88c68d0744
https://doi.org/10.1080/09728600.2021.1931555
https://doi.org/10.1080/09728600.2021.1931555