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

DOI10.1016/J.DISC.2007.10.007zbMATH Open1200.05060OpenAlexW2064856764MaRDI QIDQ998436FDOQ998436

Authors: Boštjan Brešar, Sandi Klavžar, Aleksandra Tepeh 

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

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

zbMATH Keywords

geodetic setCartesian productgeodetic numbercontour set

Mathematics Subject Classification ID

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

Cites Work

• Rebuilding convex sets in graphs
• Title not available (Why is that?)
• On the geodetic number of a graph
• Title not available (Why is that?)
• On the hull sets and hull number of the Cartesian product of graphs
• Boundary vertices in graphs
• The geodetic number of a graph
• Title not available (Why is that?)
• On geodetic sets formed by boundary vertices
• Searching for geodetic boundary vertex sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex sets under some graph operations
• On the geodetic number of median graphs
• Geodetic sets in graphs

Cited In (42)

• Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
• The geodetic domination number of comb product graphs
• Algorithmic upper bounds for graph geodetic number
• Geodetic sets in graphs
• Strong geodetic cores and Cartesian product graphs
• Geometry of good sets in \(n\)-fold Cartesian product
• Title not available (Why is that?)
• Alliance free sets in Cartesian product graphs
• On the strong metric dimension of Cartesian and direct products of graphs
• On the geodetic and geodetic domination numbers of a graph
• Boundary vertices of Cartesian product of directed graphs
• Resolvability and strong resolvability in the direct product of graphs
• The edge geodetic number and Cartesian product of graphs
• Parameterized complexity of geodetic set
• Split geodetic number of a graph
• Strong resolving graphs: the realization and the characterization problems
• Strong geodetic problem in grid-like architectures
• The simultaneous strong metric dimension of graph families
• The geodetic numbers of Cartesian products of trees
• COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS
• On the geodetic and the hull numbers in strong product graphs
• The geodetic domination number for the product of graphs
• On the geodetic number of permutation graphs
• The geodetic numbers of Cartesian products of graphs
• Bounds for the geodetic number of the Cartesian product of graphs
• Strong geodetic problem in networks
• The 2-edge geodetic number and graph operations
• 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
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
• On the toll number of a graph
• Strong edge geodetic problem in networks
• The geodetic number of the lexicographic product of graphs
• On the computational complexity of the strong geodetic recognition problem
• The geodetic number of strong product graphs
• Parameterized Complexity of Geodetic Set
• Title not available (Why is that?)
• On the hardness of finding the geodetic number of a subcubic graph
• Toll number of the strong product of graphs
• Computing the hull and interval numbers in the weakly toll convexity

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)