AbstractWe show a connection between 2-connected geodetic graphs of diameter two and certain geometric structures; we apply this result, proving that these graphs fall into three classes: (1) strongly regular graphs with μ = 1; (2) pyramids; (3) π-graphs. (The definitions for (1), (2), and (3) are given in the text.) We also give some results on graphs of type (3), including some non-existence conditions. Finally, we consider a more general class of graphs, showing a connection between some of them and Sperner spaces
AbstractA general class of matrices, which are equivalent to orthogonal Latin squares, is used to co...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
AbstractWe show a connection between 2-connected geodetic graphs of diameter two and certain geometr...
AbstractA graph G is called strongly geodetic if two arbitrary vertices are connected by at most one...
AbstractWe study the graphs in which the number of geodesics between any two vertices depends only o...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
AbstractInterval-regular graphs of diameter two are connected graphs in which any two non-adjacent v...
AbstractIn this paper, geodetic graphs of diameter two are studied. A structural description of them...
AbstractGeneralizing Cook and Pryce's construction procedures for geodetic blocks, an operation in g...
AbstractA graph is said to be F-geodetic (for some function F) if the number of shortest paths betwe...
AbstractA general class of matrices, which are equivalent to orthogonal Latin squares, is used to co...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...
AbstractWe show a connection between 2-connected geodetic graphs of diameter two and certain geometr...
AbstractA graph G is called strongly geodetic if two arbitrary vertices are connected by at most one...
AbstractWe study the graphs in which the number of geodesics between any two vertices depends only o...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new str...
AbstractInterval-regular graphs of diameter two are connected graphs in which any two non-adjacent v...
AbstractIn this paper, geodetic graphs of diameter two are studied. A structural description of them...
AbstractGeneralizing Cook and Pryce's construction procedures for geodetic blocks, an operation in g...
AbstractA graph is said to be F-geodetic (for some function F) if the number of shortest paths betwe...
AbstractA general class of matrices, which are equivalent to orthogonal Latin squares, is used to co...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
AbstractIn this paper we investigate some structural characterizations of geodetic graphs and prove ...