On the geodetic and the hull numbers in strong product graphs
From MaRDI portal
Publication:630693
DOI10.1016/j.camwa.2010.10.001zbMath1207.05043arXiv0912.3136OpenAlexW1989222222MaRDI QIDQ630693
Publication date: 19 March 2011
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.3136
Related Items (20)
Hull number: \(P_5\)-free graphs and reduction rules ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ Intervals and convex sets in strong product of graphs ⋮ Quasiperfect domination in trees ⋮ The Menger number of the strong product of graphs ⋮ Gromov hyperbolicity in strong product graphs ⋮ Convexity in partial cubes: the hull number ⋮ Geodetic convexity and Kneser graphs ⋮ Toll number of the strong product of graphs ⋮ On the strong metric dimension of the strong products of graphs ⋮ Products of geodesic graphs and the geodetic number of products ⋮ Toll number of the Cartesian and the lexicographic product of graphs ⋮ The geodetic number of the lexicographic product of graphs ⋮ Strong geodetic problem in grid-like architectures ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ THE GEODETIC DOMINATION NUMBER FOR THE PRODUCT OF GRAPHS ⋮ The hull number of powers of cycle graphs under restricted conditions ⋮ Computational and structural aspects of the geodetic and the hull numbers of shadow graphs ⋮ Computational and structural aspects of the geodetic and the hull numbers of shadow graphs ⋮ THE HULL NUMBER OF POWERS OF CYCLES
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On geodetic sets formed by boundary vertices
- Some remarks on the geodetic number of a graph
- On the geodetic number and related metric sets in Cartesian product graphs
- On the computation of the hull number of a graph
- The hull number of a graph
- The independence number of the strong product of cycles
- The primitivity of the strong product of two directed graphs
- The geodetic number of a graph
- On the hull sets and hull number of the Cartesian product of graphs
- Pancyclicity of strong products of graphs
- Bandwidth of the strong product of two connected graphs
- Geodeticity of the contour of chordal graphs
- Numerical invariants and the strong product of graphs
- Rebuilding convex sets in graphs
- Hamiltonian threshold for strong products of graphs
- Convexity in Graphs and Hypergraphs
- Extreme Geodesic Graphs
- Edge-connectivity of strong products of graphs
This page was built for publication: On the geodetic and the hull numbers in strong product graphs