Algorithmic upper bounds for graph geodetic number
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- Collective dynamics of `small-world' networks
- Computational Complexity of Geodetic Set
- On pitfalls in computing the geodetic number of a graph
- On the forcing connected geodetic number and the connected geodetic number of a graph.
- On the geodetic number and related metric sets in Cartesian product graphs
- On the geodetic number of a graph
- Products of geodesic graphs and the geodetic number of products
- Statistical mechanics of complex networks
- Strong geodetic problem in networks
- The geodetic number of a graph
- The lower and upper forcing geodetic numbers of block--cactus graphs
Cited in
(3)
This page was built for publication: Algorithmic upper bounds for graph geodetic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103929)