3 papers
math.CO2023
Formulas for the Number of Weak Homomorphisms from Paths to Rectangular Grid Graphs
Penying Rochanakul, Hatairat Yingtaweesittikul, Sayan Panma
A weak homomorphism from a graph G to a graph H is a mapping f from V(G) to V(H), where either f(x) = f(y) or {f(x), f(y)} is an element of E(H), and this holds for all {x, y} in E…
math.CO2016
-geometric graphs
Penying Rochanakul
A finite, simple and undirected graph with vertices and edges is said to be a -geometric mean graph for a positive integer if there is an injection $ψ:V…
cs.IT2011
Two-Level Fingerprinting Codes: Non-Trivial Constructions
Penying Rochanakul
We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes, to other types of fingerprinting code…