Given a graph $G$=($V$,$E$), a positive integer $k$ and a positive integer $d$, we want find a subset $V_k$ with $k$ vertices such the graph obtained by identifying the vertices from $V_k$ in $G$ has diameter at most $d$. We prove that for every $d geq 2$ the problem is NP-complete. For the case of trees we provide a polynomial time algorithm that exploits the relationship with the $r$-dominating set problem.
CitationComas, M., Serna, M. "Vertex fusion under diameter constraints". 2007.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com