On the geodetic number and related metric sets in Cartesian product graphs

DOI10.1016/j.disc.2007.10.007zbMath1200.05060OpenAlexW2064856764MaRDI QIDQ998436

Sandi Klavžar, Aleksandra Tepeh Horvat, Boštjan Brešar

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.007

zbMATH Keywords

Cartesian productgeodetic numbergeodetic setcontour set

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Parameterized Complexity of Geodetic Set ⋮ On the toll number of a graph ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ Strong edge geodetic problem in networks ⋮ The 2-edge geodetic number and graph operations ⋮ On the strong metric dimension of Cartesian and direct products of graphs ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ Computing the hull and interval numbers in the weakly toll convexity ⋮ On the geodetic and the hull numbers in strong product graphs ⋮ On the hardness of finding the geodetic number of a subcubic graph ⋮ Toll number of the strong product of graphs ⋮ Alliance free sets in Cartesian product graphs ⋮ Boundary vertices of Cartesian product of directed graphs ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ Resolvability and strong resolvability in the direct product of graphs ⋮ Products of geodesic graphs and the geodetic number of products ⋮ Toll number of the Cartesian and the lexicographic product of graphs ⋮ On the geodetic and geodetic domination numbers of a graph ⋮ The geodetic number of the lexicographic product of graphs ⋮ Strong geodetic problem in grid-like architectures ⋮ Strong geodetic problem in networks ⋮ The simultaneous strong metric dimension of graph families ⋮ Strong geodetic cores and Cartesian product graphs ⋮ THE GEODETIC DOMINATION NUMBER FOR THE PRODUCT OF GRAPHS ⋮ The geodetic domination number of comb product 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 ⋮ On the geodetic number of permutation graphs ⋮ Algorithmic upper bounds for graph geodetic number ⋮ Parameterized Complexity of Geodetic Set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On geodetic sets formed by boundary vertices
• On the geodetic number of median graphs
• The geodetic number of a graph
• Convex sets under some graph operations
• Boundary vertices in graphs
• On the hull sets and hull number of the Cartesian product of graphs
• Rebuilding convex sets in graphs
• On the geodetic number of a graph
• Searching for geodetic boundary vertex sets
• Geodetic sets in graphs