The isometric path number of a graph
From MaRDI portal
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.
Recommendations
Cited in
(18)- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- Strong geodetic number of graphs and connectivity
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- On the isometric path partition problem
- Isometric path numbers of graphs
- The ultimate isometric path number of a graph
- Strong geodetic problem on Cartesian products of graphs
- scientific article; zbMATH DE number 1439423 (Why is no real title available?)
- Fractional isometric path number
- Covering hypercubes by isometric paths
- Distance-based covering problems for graphs of given cyclomatic number
- On graphs coverable by \({k}\) shortest paths
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
- Parameterizing path partitions
- The geodesic cover problem for butterfly networks
- Distance-based (and path-based) covering problems for graphs of given cyclomatic number
- Strong geodetic problem in grid-like architectures
- Isometric-path numbers of block graphs
This page was built for publication: The isometric path number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747184)
