The least doubling constant of a path graph
We 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+2cos(π 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.
Authors
- Estíbalitz Durand-Cartagena (ORCID: https://orcid.org/0000-0001-6469-3633)
- Javier Soria (ORCID: https://orcid.org/0000-0003-3098-7056)
- Pedro Tradacete (ORCID: https://orcid.org/0000-0001-7759-3068)
Institutions
- Universidad Complutense de Madrid (ES)
- Consejo Superior de Investigaciones Científicas (ES)
- Institute of Mathematical Sciences (ES)
Publication Details
- Journal
- Kyoto journal of mathematics
- Published
- 2024-09-27
- DOI
- https://doi.org/10.1215/21562261-2024-0014
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00