Safriadi Safriadi

Papers

Total Citations

H-Index

About

Safriadi Safriadi is a mathematician whose research focuses on graph theory, particularly metric dimensions and resolving partitions of graphs. His most-cited work, "Partition Dimension of Complete Multipartite Graph" (2020, 7 citations), addresses the problem of determining resolving partitions—a concept with practical applications in fields as diverse as censor design, chemical compound classification, robotic navigation, and internet network optimization. By exploring the partition dimension of complete multipartite graphs, Safriadi contributes to a foundational area of combinatorics that helps solve real-world problems in data representation and network analysis. His work builds on the idea that for any ordered partition of a graph's vertex set, the representation of each vertex can be used to uniquely identify it, a property critical for efficient system design. Though his citation count is modest, Safriadi's research is notable for its theoretical rigor and its bridging of abstract graph theory with applied sciences. He is an emerging voice in Indonesian mathematical research, contributing to the growing body of work on graph invariants and their practical implications.