Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
From MaRDI portal
Publication:1637098
DOI10.1007/s00373-018-1885-9zbMath1388.05054arXiv1708.02416OpenAlexW2963193175MaRDI QIDQ1637098
Publication date: 7 June 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02416
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items
STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS, STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS, Strong geodetic problem on Cartesian products of graphs, On the approximation hardness of geodetic set and its variants, Strong edge geodetic problem on grids, Strong geodetic number of graphs and connectivity, Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes, Strong geodetic problem in networks, Strong geodetic cores and Cartesian product graphs, Strong geodetic problem on complete multipartite graphs, An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong geodetic problem in grid-like architectures
- Geodetic contraction games on graphs
- The geodetic number of a graph
- Products of geodesic graphs and the geodetic number of products
- Strong geodetic problem in networks
- Strong edge geodetic problem in networks
- The geodetic numbers of graphs and digraphs
- Isometric path numbers of graphs
- On the geodetic number of a graph
- Geodetic Number versus Hull Number in $P_3$-Convexity
- Geodesic Convexity in Graphs
- Computing Minimum Geodetic Sets of Proper Interval Graphs
- Block decomposition approach to compute a minimum geodetic set
- Geodetic Sets in Graphs
- Graphs with large geodetic number
- Edge geodetic number of a graph
