Suchir Kaustav

Papers

Total Citations

H-Index

About

Suchir Kaustav is a mathematician whose work explores the intersection of graph theory and metric geometry, with a particular focus on the metric dimension of graphs—a parameter that measures how uniquely vertices can be identified by their distances to a chosen set of landmarks. His most-cited paper, "Extremal results for graphs of bounded metric dimension" (2021, 4 citations), makes a significant contribution by establishing sharp bounds on the structure and size of graphs whose metric dimension is fixed. This work provides foundational insights for applications in network theory, robot navigation, and chemical graph theory, where metric dimension helps optimize location and identification problems. Kaustav's research is characterized by its rigorous combinatorial approach and its ability to bridge abstract graph properties with practical constraints. His findings have been cited by peers working on extremal graph theory and algorithmic design, underscoring their relevance to both theoretical and applied domains. As an emerging voice in discrete mathematics, Kaustav continues to advance our understanding of how graph invariants shape network behavior.