Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Penying Rochanakul"'
Publikováno v:
Journal of Mathematics, Vol 2023 (2023)
Let G and H be graphs. A mapping f from VG to VH is called a weak homomorphism from G to H if fx=fy or fx,fy∈EH whenever x,y∈EG. A ladder graph is the Cartesian product of two paths, where one of the paths has only one edge. A stacked prism graph
Externí odkaz:
https://doaj.org/article/9c6c615b6df34319bf3f3f14c83c2060
Publikováno v:
Mathematics, Vol 11, Iss 11, p 2587 (2023)
Let G and H be graphs. A mapping f from the vertices of G to the vertices of H is known as a homomorphism from G to H if, for every pair of adjacent vertices x and y in G, the vertices f(x) and f(y) are adjacent in H. A rectangular grid graph is the
Externí odkaz:
https://doaj.org/article/4f911ab7317b403b943e1ab3d300dbf4
Autor:
Penying Rochanakul
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2020 (2020)
Frameproof codes were first introduced by Boneh and Shaw in 1998 in the context of digital fingerprinting to protect copyrighted materials. These digital fingerprints are generally denoted as codewords in Qn, where Q is an alphabet of size q and n is
Externí odkaz:
https://doaj.org/article/ab29eed66c0341fb8f2e5c255ae6c746