Eriky Marciano

Apr 11, 2024 | onlinelibrary.wiley.com | Luis Cunha |Anderson Moraes |Leandro Santiago |Eriky Marciano

The t $$ t $$ -admissibility is a min-max problem that concerns to determine whether a graph G $$ G $$ contains a spanning tree T $$ T $$ in which the distance between any two adjacent vertices of  G $$ G $$ is at most  t $$ t $$ in T $$ T $$ . The stretch index of G $$ G $$ , σ ( G ) $$ \sigma (G) $$ , is the smallest  t $$ t $$ for which G $$ G $$ is t $$ t $$ -admissible.