Vertex fusion under distance constraints

  • Authors:

  • Marc Comas;Maria Serna

  • Affiliations:

  • ALBCOM Research Group, LSI Department, Universitat Politècnica Catalunya (UPC), c/ Jordi Girona, 1-3, 08034 Barcelona, Spain;ALBCOM Research Group, LSI Department, Universitat Politècnica Catalunya (UPC), c/ Jordi Girona, 1-3, 08034 Barcelona, Spain

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we analyze parameter improvement under vertex fusion in a graph G. This is a setting in which a new graph G^' is obtained after identifying a subset of vertices of G in a single vertex. We are interested in distance parameters, in particular diameter, radius and eccentricity of a vertex v. We show that the corresponding problem is NP-Complete for the three parameters. We also find graph classes in which the problem can be solved in polynomial time.