Add to ORKGAbstract. For two vertices u and v of an oriented graph D, the set I(u, v) consists of all vertices lying on a u−v geodesic or v−u geodesic in D. If S is a set of vertices of D, then I(S) is the union of all sets I(u, v) for vertices u and v in S. The geodetic number g(D) is the minimum cardinality among the subsets S of V (D) with I(S) = V (D). In this paper, we give a partial answer for the conjecture by G. Chartrand and P. Zhang and present some results on orientable geodetic number. AMS Mathematics Subject Classification: 05C12. Key words and phrases: Geodetic set, geodetic number
AbstractA set S of vertices of a graph G is a geodetic set if every vertex of G lies in an interval ...
For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for ...
Abstract. An edge geodetic set of a connected graph G of order p ≥ 2 is a set S ⊆ V (G) such that ev...
AbstractFor two vertices u and v of an oriented graph D, the set I(u, v) consists of all vertices ly...
AbstractA set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path be...
For two vertices u and v of a graph G, the closed interval I[u,v] consists of u, v, and all vertices...
For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u-v ge...
Geodetic numbers of graphs & digraphs have been investigated in the literature recently. The main pu...
For a connected graph G of order n, a set S of vertices of G is a geodetic set of G if each vertex ...
AbstractFor a connected graph G of order p≥2, a set S⊆V(G) is a geodetic set of G if each vertex v∈V...
For two vertices u and v of a connected graph G, the set $I_G[u,v]$ consists of all those vertices l...
For a connected graph G of ordern, a set S of vertices of G is a geodetic set of G ifeach vertex n o...
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interva...
AbstractFor every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. Fo...
AbstractA set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one...
AbstractA set S of vertices of a graph G is a geodetic set if every vertex of G lies in an interval ...
For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for ...
Abstract. An edge geodetic set of a connected graph G of order p ≥ 2 is a set S ⊆ V (G) such that ev...
AbstractFor two vertices u and v of an oriented graph D, the set I(u, v) consists of all vertices ly...
AbstractA set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path be...
For two vertices u and v of a graph G, the closed interval I[u,v] consists of u, v, and all vertices...
For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u-v ge...
Geodetic numbers of graphs & digraphs have been investigated in the literature recently. The main pu...
For a connected graph G of order n, a set S of vertices of G is a geodetic set of G if each vertex ...
AbstractFor a connected graph G of order p≥2, a set S⊆V(G) is a geodetic set of G if each vertex v∈V...
For two vertices u and v of a connected graph G, the set $I_G[u,v]$ consists of all those vertices l...
For a connected graph G of ordern, a set S of vertices of G is a geodetic set of G ifeach vertex n o...
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interva...
AbstractFor every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. Fo...
AbstractA set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one...
AbstractA set S of vertices of a graph G is a geodetic set if every vertex of G lies in an interval ...
For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for ...
Abstract. An edge geodetic set of a connected graph G of order p ≥ 2 is a set S ⊆ V (G) such that ev...