Durand Cartagena, EstibalitzSoria de Diego, Francisco JavierTradacete Pérez, Pedro2025-01-302025-01-302025Durand-Cartagena E, Soria J, Tradacete P. The least doubling constant of a path graph. Kyoto J Math 2025; 65. [DOI: 10.1215/21562261-2024-0014]10.1215/21562261-2024-0014https://hdl.handle.net/20.500.14352/117218We study the least doubling constant CG among all possible doubling measures defined on a path graph G. We consider both finite and infinite cases and show that, if G = Z, CZ = 3, while for G = Ln, the path graph with n vertices, one has 1 + 2 cos( π / n+1 ) ≤ CLn < 3, with equality on the lower bound if and only if n ≤ 8. Moreover, we analyze the structure of doubling minimizers on Ln and Z, those measures whose doubling constant is the smallest possible.engAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/journal articlehttps://doi.org/10.1215/21562261-2024-0014open accessDoubling measureLeast doubling constantLinear graphMatemáticas (Matemáticas)12 Matemáticas