Geodetic sets in graphs
From MaRDI portal
Publication:4522466
DOI10.7151/dmgt.1112zbMath0958.05044OpenAlexW2064260475MaRDI QIDQ4522466
Ping Zhang, Gary Chartrand, Frank Harary
Publication date: 30 March 2001
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cd84b9e7fcf1761eedb8288b6f3e1a80387ebf54
Related Items
The near geodetic number of a graph ⋮ Unnamed Item ⋮ Monophonic numbers of the join and composition of connected graphs ⋮ Strong edge geodetic problem in networks ⋮ The Connected Edge-To-Vertex Geodetic Number of a Graph ⋮ Algorithms and complexity for geodetic sets on partial grids ⋮ Total restrained geodetic number of graphs ⋮ Unnamed Item ⋮ On the geodetic number of median graphs ⋮ Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ On the geodetic and geodetic domination numbers of a graph ⋮ Strong geodetic problem in networks ⋮ On the geodetic number and related metric sets in Cartesian product graphs ⋮ Strong geodetic cores and Cartesian product graphs ⋮ On minimal geodetic domination in graphs ⋮ The forcing near geodetic number of a graph ⋮ Comment on "Edge Geodetic Covers in Graphs ⋮ The upper restrained Steiner number of a graph ⋮ Strong geodetic problem on complete multipartite graphs ⋮ Geodomination in graphs II ⋮ Connected geodomination in graphs ⋮ Rebuilding convex sets in graphs ⋮ The restrained geodetic number of a graph
