AbstractAn upper bound for the number of lines in a geodetic block of diameter d on p points is obtained, using some new general properties of geodetic blocks which are also of independent interest
International audienceGiven a graph, a geodetic set (resp. edge geodetic set) is a subset of vertice...
International audienceGiven a graph, a geodetic set (resp. edge geodetic set) is a subset of vertice...
AbstractA subset S of vertices in a graph G is a called a geodetic set if every vertex not in S lies...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
AbstractA general construction procedure for geodetic blocks, starting from an arbitrary geodetic bl...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
AbstractGeneralizing Cook and Pryce's construction procedures for geodetic blocks, an operation in g...
AbstractA set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
AbstractA set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path be...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
AbstractWe study the graphs in which the number of geodesics between any two vertices depends only o...
AbstractA set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path be...
International audienceGiven a graph, a geodetic set (resp. edge geodetic set) is a subset of vertice...
International audienceGiven a graph, a geodetic set (resp. edge geodetic set) is a subset of vertice...
AbstractA subset S of vertices in a graph G is a called a geodetic set if every vertex not in S lies...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
AbstractA general construction procedure for geodetic blocks, starting from an arbitrary geodetic bl...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
AbstractGeneralizing Cook and Pryce's construction procedures for geodetic blocks, an operation in g...
AbstractA set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
AbstractA set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path be...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
AbstractWe study the graphs in which the number of geodesics between any two vertices depends only o...
AbstractA set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path be...
International audienceGiven a graph, a geodetic set (resp. edge geodetic set) is a subset of vertice...
International audienceGiven a graph, a geodetic set (resp. edge geodetic set) is a subset of vertice...
AbstractA subset S of vertices in a graph G is a called a geodetic set if every vertex not in S lies...
DOI
Add to ORKG