On the geodetic and the hull numbers in strong product graphs
From MaRDI portal
(Redirected from Publication:630693)
Abstract: A set S of vertices of a connected graph G is convex, if for any pair of vertices u; v 2 S, every shortest path joining u and v is contained in S . The convex hull CH(S) of a set of vertices S is defined as the smallest convex set in G containing S. The set S is geodetic, if every vertex of G lies on some shortest path joining two vertices in S, and it is said to be a hull set if its convex hull is V(G). The geodetic and the hull numbers of G are the cardinality of a minimum geodetic and a minimum hull set, respectively. In this work, we investigate the behavior of both geodetic and hull sets with respect to the strong product operation for graphs. We also stablish some bounds for the geodetic number and the hull number and obtain the exact value of these parameters for a number of strong product graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 2192211 (Why is no real title available?)
- Bandwidth of the strong product of two connected graphs
- Chromatic numbers of the strong product of odd cycles
- Convexity in Graphs and Hypergraphs
- Convexity, geodetic, and hull numbers of the join of graphs
- Edge-connectivity of strong products of graphs
- Extreme Geodesic Graphs
- Generalizing the Krein-Milman property in graph convexity spaces: a short survey
- Geodeticity of the contour of chordal graphs
- Hamiltonian threshold for strong products of graphs
- Numerical invariants and the strong product of graphs
- On geodetic sets formed by boundary vertices
- On the computation of the hull number of a graph
- On the geodetic number and related metric sets in Cartesian product graphs
- On the hull sets and hull number of the Cartesian product of graphs
- Pancyclicity of strong products of graphs
- Rebuilding convex sets in graphs
- Some remarks on the geodetic number of a graph
- The geodetic 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
Cited in
(25)- The Menger number of the strong product of graphs
- On the strong metric dimension of the strong products of graphs
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- Gromov hyperbolicity in strong product graphs
- Convexity in partial cubes: the hull number
- Strong geodetic problem in grid-like architectures
- Hull number: \(P_5\)-free graphs and reduction rules
- On the \(P_3\)-hull number of some products of graphs
- Geodetic convexity and Kneser graphs
- The geodetic domination number for the product of graphs
- Quasiperfect domination in trees
- Intervals and convex sets in strong product of graphs
- THE HULL NUMBER OF POWERS OF CYCLES
- 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
- Toll number of the Cartesian and the lexicographic product of graphs
- Products of geodesic graphs and the geodetic number of products
- On the geodetic and hull numbers of shadow graphs
- The geodetic number of the lexicographic product of graphs
- The geodetic number of strong product graphs
- Pre-hull number of Cartesian and strong graph products
- Convexity, geodetic, and hull numbers of the join of graphs
- The hull number of strong product graphs
- Toll number of the strong product of graphs
This page was built for publication: On the geodetic and the hull numbers in strong product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630693)
