engleski

Some properties of k-geodetic graphs

Graphs in which each pair of nonadjacent vertices has at most k paths of minimum length between them are called k-geodetic graphs. We will discuss some properties of k-geodetic graphs constructed from block designs. LDPC codes based on the adjacency matrix of k- geodetic graphs obtained from block designs will be introduced

k-geodetic graph ; automorphism group ; LDPC code

nije evidentirano