Products of geodesic graphs and the geodetic number of products

DOI10.7151/dmgt.1774zbMath1307.05063OpenAlexW2043551461MaRDI QIDQ2259562

Rommy A. Márquez, Jake A. Soloff, Louis M. Friedler

Publication date: 4 March 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1774

zbMATH Keywords

Cartesian productsgeodetic numbergeodesic graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (8)

Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ Strong geodetic number of graphs and connectivity ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ Strong geodetic problem in grid-like architectures ⋮ Strong geodetic problem in networks ⋮ Strong geodetic cores and Cartesian product graphs ⋮ Algorithmic upper bounds for graph geodetic number

Cites Work

• On the geodetic and the hull numbers in strong product graphs
• On the geodetic number and related metric sets in Cartesian product graphs
• The geodetic number of a graph
• On the geodetic number of a graph
• Geodetic Sets in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Products of geodesic graphs and the geodetic number of products