In 2024, I participated as a young researcher of Mathematics and Computer Science in HLF (Heidelberg Laureate Forum). I still remember correctly how important this international networking was in changing my perspective on research and supporting my career journey. Meeting well known researcher and engaging with them was truly inspiring. That experience motivates me to not only consider theoretical aspects but also laureate’s personal research journey. As a researcher from a developing country, I need more opportunities, open doors, visibilities, and recognitions. I see the Hong Kong Laureate Forum as a continuation of that journey, where I can gain new perspectives, be exposed to different schools of thought, and connect to more researcher from around the globe.
As I know that Hong Kong Laureate Forum bring another perspective from HLF, I must apply. In this forum, I can meet Scientist (not only Mathematician). I believe HKLF offers an opportunity to interact with laureates across disciplines that are essential for major breakthroughs. My background in graph theory can be the good tools to reconnect as graph is the mathematics tools to understand connection. I also hope to share my experience and bring back inspiration to young scientists in my home institution.

Many real-world issues can be modeled using graphs consisting of points called vertices and connecting lines called edges. Graph labeling is an area of study where elements of a graph are assigned numbers known as labels, according to certain rules specific to the type of labeling. Let G be a finite simple graph. For a given graph H, a graph G admits a an H-covering if each edge of G belongs to any subgraph isomorphic to H. Suppose that G admits H-covering. A bijection function f from the set of vertices and edges of G to the set of positive numbers from 1 to the order and size of G is called H-magic labeling if the sum of vertex and edge label associated with the subgraph is constant. An H-magic labelling can be applied to a fault-tolerance system. We define G to be (F,H)-sim-magic if there exists a bijection g that is simultaneously F-magic and H-magic. We aim to understand how two different types of labelings are related, so we study (K_2, H)-sim-(super)magic, where H represents graphs with different symmetries. We identify its forbidden subgraph and structures and characterize the graph. Overall, our work expands the known types of labelings.