On eliminating vertices from a tree
type: Item
instance of: scholarly article
title: On eliminating vertices from a tree
zbMATH Open document ID: 0639.90028
DOI: 10.1016/0305-0548(88)90036-6
author: I. Douglas Moon
published in: Computers \& Operations Research
publication date: 1988-01-01T00:00:00Z
review text: The removal of any vertex incident with at least three edges in a tree network would cause a significant structural change in the tree. We discuss the need for such vertex removals and establish relationships between distances on a tree resulting from removing at least one vertex and those on the original tree.
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 4043574
zbMATH Keywords: location on networks
zbMATH Keywords: tree network
zbMATH Keywords: vertex removals
MaRDI profile type: Publication
full work available at URL: 0305-0548(88)90036-6
OpenAlex ID: W1980348953
cites work: Q3316922
cites work: An Analysis of Network Location Problems with Distance Constraints
description: scientific article; zbMATH DE number 4043574