Loeky Haryanto

Papers

Total Citations

H-Index

About

Loeky Haryanto is a prominent researcher in graph theory, with a particular focus on metric dimensions and resolving partitions of complex graph structures. His key research areas include the partition dimension of graphs, graph labeling, and combinatorial optimization, where he explores fundamental properties with real-world applications in fields such as network design, chemical compound classification, and robotic navigation. Haryanto's major contribution lies in his work on the partition dimension of complete multipartite graphs, where he established novel methods for determining resolving partitions—a concept critical for uniquely identifying vertices in a graph through distance-based representations. His most-cited paper, "Partition Dimension of Complete Multipartite Graph" (2020), has garnered 7 citations, reflecting its influence in advancing theoretical understanding and practical utility. This work provides a foundation for applications like censor design and internet network optimization, demonstrating the power of graph theory in solving complex problems. Haryanto's achievements highlight his role in bridging abstract mathematical concepts with tangible technological solutions, making his research a valuable resource for students and researchers exploring metric graph theory and its interdisciplinary impact.