On the minimum distance in a \(k\)-vertex set in a graph
type: Item
instance of: scholarly article
title: On the minimum distance in a \(k\)-vertex set in a graph
zbMATH Open document ID: 1428.05082
author: Martin Knor
author: Riste Škrekovski
published in: Applied Mathematics and Computation
publication date: 2019-11-29T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7138602
zbMATH Keywords: distance
zbMATH Keywords: \(k\)-subset of vertices
zbMATH Keywords: graph
MaRDI profile type: Publication
full work available at URL: j.amc.2019.03.050
OpenAlex ID: W2931136162
cites work: Maximal Wiener index for graphs with prescribed number of blocks
cites work: Q3024734
cites work: Q5476554
cites work: Q3421435
DOI: 10.1016/J.AMC.2019.03.050
description: scientific article; zbMATH DE number 7138602