On the minimum distance in a \(k\)-vertex set in a graph (Q2009525): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2019.03.050 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2931136162 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal Wiener index for graphs with prescribed number of blocks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3024734 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5476554 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3421435 / rank | |||
Normal rank | |||
Latest revision as of 03:25, 21 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the minimum distance in a \(k\)-vertex set in a graph |
scientific article |
Statements
On the minimum distance in a \(k\)-vertex set in a graph (English)
0 references
29 November 2019
0 references
distance
0 references
\(k\)-subset of vertices
0 references
graph
0 references
