On the geodetic number and related metric sets in Cartesian product graphs
From MaRDI portal
(Redirected from Publication:998436)
Recommendations
- The geodetic numbers of Cartesian products of graphs
- Bounds for the geodetic number of the Cartesian product of graphs
- The edge geodetic number and Cartesian product of graphs
- Products of geodesic graphs and the geodetic number of products
- The geodetic number of the lexicographic product of graphs
- Some results on geodetic number of graphs
- On the metric dimension of Cartesian products of graphs
- On the Metric Dimension of Cartesian Products of Graphs
- scientific article; zbMATH DE number 7144862
- The geodetic number of strong product graphs
Cites work
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 38308 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 2104812 (Why is no real title available?)
- scientific article; zbMATH DE number 2192211 (Why is no real title available?)
- Boundary vertices in graphs
- Convex sets under some graph operations
- Geodetic sets in graphs
- On geodetic sets formed by boundary vertices
- On the geodetic number of a graph
- On the geodetic number of median graphs
- On the hull sets and hull number of the Cartesian product of graphs
- Rebuilding convex sets in graphs
- Searching for geodetic boundary vertex sets
- The geodetic number of a graph
Cited in
(41)- Strong geodetic cores and Cartesian product graphs
- The geodetic number of strong product graphs
- Geodetic sets in graphs
- The 2-edge geodetic number and graph operations
- On the strong metric dimension of Cartesian and direct products of graphs
- Strong geodetic problem in networks
- Geometry of good sets in \(n\)-fold Cartesian product
- On the computational complexity of the strong geodetic recognition problem
- On the geodetic and geodetic domination numbers of a graph
- On the geodetic and the hull numbers in strong product graphs
- The edge geodetic number and Cartesian product of graphs
- Products of geodesic graphs and the geodetic number of products
- Parameterized complexity of geodetic set
- The geodetic domination number for the product of graphs
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- scientific article; zbMATH DE number 7144862 (Why is no real title available?)
- On the geodetic number of permutation graphs
- Alliance free sets in Cartesian product graphs
- The geodetic numbers of Cartesian products of trees
- The geodetic domination number of comb product graphs
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- On the toll number of a graph
- Strong geodetic problem in grid-like architectures
- On the hardness of finding the geodetic number of a subcubic graph
- Strong edge geodetic problem in networks
- The simultaneous strong metric dimension of graph families
- Parameterized Complexity of Geodetic Set
- Toll number of the strong product of graphs
- Toll number of the Cartesian and the lexicographic product of graphs
- The geodetic numbers of Cartesian products of graphs
- Algorithmic upper bounds for graph geodetic number
- Strong resolving graphs: the realization and the characterization problems
- Split geodetic number of a graph
- COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS
- Computing the hull and interval numbers in the weakly toll convexity
- scientific article; zbMATH DE number 6010675 (Why is no real title available?)
- Bounds for the geodetic number of the Cartesian product of graphs
- 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
- Boundary vertices of Cartesian product of directed graphs
- The geodetic number of the lexicographic product of graphs
This page was built for publication: On the geodetic number and related metric sets in Cartesian product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998436)