The geodetic number of a graph

DOI10.1016/0895-7177(93)90259-2zbMath0825.68490OpenAlexW2038715674WikidataQ130426324 ScholiaQ130426324MaRDI QIDQ1310238

Emmanuel Loukakis, Frank Harary, Constantine Tsouros

Publication date: 21 December 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90259-2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (88)

2-EDGE CLOSURE ABSORBING SETS IN A GRAPH ⋮ The connected vertex detour monophonic number of a graph ⋮ THE LINEAR GEODETIC NUMBER OF A GRAPH ⋮ EXTREME STEINER GRAPHS ⋮ The Upper and Forcing Connected Outer Connected Geodetic Numbers of a Graph ⋮ Extreme Geodesic Graphs ⋮ On the geodetic hull number of \(P_{k}\)-free graphs ⋮ Weak edge triangle free detour number of a graph ⋮ Universal lines in graphs ⋮ Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ Well-partitioned chordal graphs ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ The forcing vertex detour monophonic number of a graph ⋮ Upper triangle free detour number of a graph ⋮ Upper detour monophonic number of a graph ⋮ A general framework for path convexities ⋮ The near geodetic number of a graph ⋮ STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS ⋮ STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS ⋮ On the toll number of a graph ⋮ The strong convexity spectra of grids ⋮ Strong edge geodetic problem in networks ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ Restrained geodetic domination of edge subdivision graph ⋮ Algorithms and complexity for geodetic sets on partial grids ⋮ Monitoring edge-geodetic sets: hardness and graph products ⋮ Computing the hull and interval numbers in the weakly toll convexity ⋮ The restrained double geodetic number of a graph ⋮ Monitoring edge-geodetic sets in graphs ⋮ CHELO INDEX FOR GRAPHS ⋮ THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH ⋮ Tension on an edge in a graph ⋮ Partially balanced incomplete block (PBIB)-designs associated with geodetic sets in graphs ⋮ More on the outer connected geodetic number of a graph ⋮ On the geodetic and the hull numbers in strong product graphs ⋮ Three problems on well-partitioned chordal graphs ⋮ The lower and upper forcing geodetic numbers of block--cactus graphs ⋮ On the approximation hardness of geodetic set and its variants ⋮ RESTRAINED DOUBLE MONOPHONIC NUMBER OF A GRAPH ⋮ Unnamed Item ⋮ The connected monophonic number of a graph ⋮ Toll number of the strong product of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the (M, D) number of a graph ⋮ Upper double monophonic number of a graph ⋮ The total double geodetic number of a graph ⋮ On the geodetic number of median graphs ⋮ On pitfalls in computing the geodetic number of a graph ⋮ CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT ⋮ A cut locus for finite graphs and the farthest point mapping ⋮ Strong edge geodetic problem on grids ⋮ Unnamed Item ⋮ Strong geodetic number of graphs and connectivity ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ Some remarks on the geodetic number of a graph ⋮ Unnamed Item ⋮ Products of geodesic graphs and the geodetic number of products ⋮ Toll number of the Cartesian and the lexicographic product of graphs ⋮ On the Steiner, geodetic and hull numbers of graphs ⋮ The geodetic number of the lexicographic product of graphs ⋮ The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori ⋮ Strong geodetic problem in grid-like architectures ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Strong geodetic problem in networks ⋮ On the geodetic number and related metric sets in Cartesian product graphs ⋮ THE GEODETIC DOMINATION NUMBER FOR THE PRODUCT OF 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 ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ On the geodetic number of permutation graphs ⋮ The forcing near geodetic number of a graph ⋮ Comment on "Edge Geodetic Covers in Graphs ⋮ Strong geodetic problem on complete multipartite graphs ⋮ On The Edge Geodetic Number Of A Graph ⋮ The outer connected geodetic number of a graph ⋮ The \((a,b)\)-forcing geodetic graphs ⋮ The hull and geodetic numbers of orientations of graphs ⋮ The upper connected geodetic number and forcing connected geodetic number of a graph ⋮ The forcing hull and forcing geodetic numbers of graphs ⋮ Further results on the outer connected geodetic number of a graph ⋮ Restrained geodetic domination in graphs ⋮ Algorithmic upper bounds for graph geodetic number ⋮ Some structural, metric and convex properties on the boundary of a graph ⋮ Graphs with large total geodetic number ⋮ On the edge geodetic and edge geodetic domination numbers of a graph

Cites Work

• Dominating sets for split and bipartite graphs
• Convexity in graphs
• Parallel concepts in graph theory

This page was built for publication: The geodetic number of a graph