Products of geodesic graphs and the geodetic number of products
From MaRDI portal
Publication:2259562
DOI10.7151/dmgt.1774zbMath1307.05063MaRDI 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
Related Items
Strong geodetic problem on Cartesian products of graphs, Strong geodetic problem in grid-like architectures, Strong geodetic number of complete bipartite graphs and of graphs with specified diameter, Strong geodetic number of graphs and connectivity, Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes, Algorithmic upper bounds for graph geodetic number, Strong geodetic problem in networks, Strong geodetic cores and Cartesian product graphs
Cites Work