The isometric path number of a graph (Q2747184)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The isometric path number of a graph |
scientific article; zbMATH DE number 1657301
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The isometric path number of a graph |
scientific article; zbMATH DE number 1657301 |
Statements
21 January 2002
0 references
isometric
0 references
path
0 references
cover
0 references
Cartesian product
0 references
The isometric path number of a graph (English)
0 references
An isometric path is any shortest path between two vertices of a graph \(G\). The isoperimetric path number of \(G\), denoted \(p(G)\), is the minimum number of isoperimetric paths covering all vertices of \(G\). In the paper a lower bound on \(p(G)\) in termes of the diameter of \(G\) is given. Further, the value of \(p(G)\) is determined for trees and grid graphs.
0 references
