Jember, May 21, 2024 - The Center for Excellence in Higher Education Science and Technology (PUI-PT) Combinatorics and Graphs of Jember University held a Focus Group Discussion (FGD) entitled "Super (a,d)-Hyperedge Antimagic Total Labeling of Hyper-Caterpillar and Hyper-Diamond Ladder Graph" on Tuesday. This activity took place at the CDAST Building 8th Floor Conference Room. This discussion was attended by students of Mathematics Education Department, Faculty of Teacher Training and Education. This discussion aims to explore and further study the concept of antimagic labeling on special graphs, namely hyper-caterpillar and hyper-diamond ladder graph. Total antimagic labeling on these graphs is a topic that has become the center of attention in the field of graph theory due to its wide applications and implications in various disciplines.

Chairman of PUI-PT Combinatorics and Graphs, Prof. Drs. Dafik, M.Sc., Ph.D., in his speech conveyed the importance of research in the field of graph theory for the development of science and technology. "This discussion is expected to broaden our insight and understanding of the concept of super (a,d)-hyperedge antimagic total labeling, and facilitate more intensive research collaboration in the future," said Prof. Dafik. One of the keynote speakers, Prof. Swaminathan Venkatraman from Sastra Deemed to be University, India, presented his findings on the structure and characteristics of hyper-caterpillars that enable the application of antimagic labeling. In addition, Rosanita Nisviasari, S.Si., M.Si. from PUI-PT Combinatorics and Graph discussed her findings "Hyper-Edge Antimagic Total Labeling of Hyper-Diamond Ladder Graph".

The event was closed with an interactive Q&A session, where the participants could ask questions directly to the speakers. The conclusion of this FGD stated that there are still many research opportunities that can be explored further, especially in the development of theory and practical applications of antimagic labeling on various types of graphs. By organizing this FGD, PUI-PT Combinatorics and Graphs hopes to continue to contribute to the development of combinatorics and graph theory in Indonesia, and encourage collaboration between researchers to achieve new breakthroughs in this field.