On the minimum distance in a \(k\)-vertex set in a graph

DOI10.1016/j.amc.2019.03.050zbMath1428.05082OpenAlexW2931136162MaRDI QIDQ2009525

Riste Škrekovski, Martin Knor

Publication date: 29 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.03.050

zbMATH Keywords

graphdistance\(k\)-subset of vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items

The \(k\)-independence number of \(t\)-connected graphs, The structure of graphs with given number of blocks and the maximum Wiener index

Cites Work

• Maximal Wiener index for graphs with prescribed number of blocks
• Unnamed Item
• Unnamed Item
• Unnamed Item