In this paper authors have obtained a new necessary and sufficient condition for a graph G to be a geodetic graph. Let g : E --> Z(+) be a function from the set of edges of a graph G to the set of nonnegative integ...In this paper authors have obtained a new necessary and sufficient condition for a graph G to be a geodetic graph. Let g : E --> Z(+) be a function from the set of edges of a graph G to the set of nonnegative integers and let g(G) denote the graph obtained from G by replacing each edge e is an element of E by a suspended are (path) P-g(e+2) of length g(e) + 1. and by using this condition, established a criterion for a function g to be a function which can generate a new geodetic block g(G) from a given geodetic block G.展开更多
In this paper, we use the concept of an allowable geodetic block which we propose here and orthogonal latin square to construct geodetic blocks which generalize the construction of Ho jin Lee .
文摘In this paper authors have obtained a new necessary and sufficient condition for a graph G to be a geodetic graph. Let g : E --> Z(+) be a function from the set of edges of a graph G to the set of nonnegative integers and let g(G) denote the graph obtained from G by replacing each edge e is an element of E by a suspended are (path) P-g(e+2) of length g(e) + 1. and by using this condition, established a criterion for a function g to be a function which can generate a new geodetic block g(G) from a given geodetic block G.
文摘In this paper, we use the concept of an allowable geodetic block which we propose here and orthogonal latin square to construct geodetic blocks which generalize the construction of Ho jin Lee .