Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Gee-Choon Lau"'
Autor:
Gee-Choon Lau1 geeclau@yahoo.com, Schaffer, Karl2 karl_schaffer@yahoo.com, Wai Chee Shiu3 wcshiu@associate.hkbu.edu.hk
Publikováno v:
Opuscula Mathematica. 2023, Vol. 43 Issue 6, p841-864. 24p.
Autor:
Gee-Choon Lau1 geeclau@yahoo.com, Wai Chee Shiu2 wcshiu@associate.hkbu.edu.hk
Publikováno v:
Opuscula Mathematica. 2023, Vol. 43 Issue 3, p429-453. 25p.
Publikováno v:
Discrete Mathematics Letters, Vol 11, Pp 76-83 (2023)
Externí odkaz:
https://doaj.org/article/13c1423f7cad4e67a2f257c58dc54724
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:
Communications in Combinatorics & Optimization; 2024, Vol. 9 Issue 3, p509-526, 18p
Autor:
Priyadharshini V.1 priyavenkat1310@gmail.com, Perrichiappan A.1 perrichiappan.annamalai@gmail.com, Nalliah M.1 nalliahklu@gmail.com, Gee-Choon Lau2 geeclau@yahoo.com
Publikováno v:
Proyecciones - Journal of Mathematics. Apr2024, Vol. 43 Issue 2, p473-494. 22p.
Publikováno v:
Iranian Journal of Mathematical Sciences & Informatics; 2024, Vol. 19 Issue 1, p1-17, 17p
Autor:
GEE-CHOON LAU1 geeclau@yahoo.com, WAI-CHEE SHIU2 wcshiu@hkbu.edu.hk, HO-KUEN NG3 ho-kuen.ng@sjsu.edu
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2021, Vol. 41 Issue 1, p133-152. 20p.
Publikováno v:
Journal of King Saud University: Science, Vol 30, Iss 2, Pp 286-291 (2018)
Let G=(V,E) be a simple, finite and undirected (p,q)-graph with p vertices and q edges. A graph G is Skolem odd difference mean if there exists an injection f:V(G)→{0,1,2,…,p+3q-3} and an induced bijection f∗:E(G)→{1,3,5,…,2q-1} such that e
Externí odkaz:
https://doaj.org/article/d5e717348e044f9da212c75db88abbc1
Autor:
Wai-Chee Shiu, Gee-Choon Lau
Publikováno v:
Symmetry, Vol 13, Iss 5, p 849 (2021)
Let G=(V(G),E(G)) be a simple, finite and undirected graph of order n. Given a bijection f:V(G)→{1,…,n}, and every edge uv in E(G), let S=f(u)+f(v) and D=|f(u)−f(v)|. The labeling f induces an edge labeling f′:E(G)→{0,1} such that for an ed
Externí odkaz:
https://doaj.org/article/a65f4469a10549b79ca4d79b56be783d