summary:In [3], the present author used a binary operation as a tool for characterizing geodetic graphs. In this paper a new proof of the main result of the paper cited above is presented. The new proof is shorter and simpler
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
summary:The concept of a route system was introduced by the present author in [3].Route systems of a...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
summary:In [3], the present author used a binary operation as a tool for characterizing geodetic gra...
summary:We say that a binary operation $*$ is associated with a (finite undirected) graph $G$ (witho...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
summary:The interval function (in the sense of H. M. Mulder) is an important tool for studying those...
AbstractA set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path be...
AbstractA graph G is called strongly geodetic if two arbitrary vertices are connected by at most one...
AbstractFor every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. Fo...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
AbstractGeneralizing Cook and Pryce's construction procedures for geodetic blocks, an operation in g...
summary:Let $G$ be a (finite undirected) connected graph (with no loop or multiple edge). The set $\...
AbstractOre defined a graph to be geodetic if and only if there is a unique shortest path between tw...
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...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
summary:The concept of a route system was introduced by the present author in [3].Route systems of a...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
summary:In [3], the present author used a binary operation as a tool for characterizing geodetic gra...
summary:We say that a binary operation $*$ is associated with a (finite undirected) graph $G$ (witho...
summary:A (finite) acyclic connected graph is called a tree. Let $W$ be a finite nonempty set, and l...
summary:The interval function (in the sense of H. M. Mulder) is an important tool for studying those...
AbstractA set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path be...
AbstractA graph G is called strongly geodetic if two arbitrary vertices are connected by at most one...
AbstractFor every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. Fo...
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between tw...
AbstractGeneralizing Cook and Pryce's construction procedures for geodetic blocks, an operation in g...
summary:Let $G$ be a (finite undirected) connected graph (with no loop or multiple edge). The set $\...
AbstractOre defined a graph to be geodetic if and only if there is a unique shortest path between tw...
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...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
summary:The concept of a route system was introduced by the present author in [3].Route systems of a...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
DOI
Add to ORKG