Some properties of $k$-geodetic graphs
Sanja Rukavina
Department of Mathematics, University of Rijeka
Dean Crnković
Department of Mathematics, University of Rijeka
Marina Šimac
Department of Mathematics, University of Rijeka
PDF
Minisymposium: GENERAL SESSION TALKS
Content: 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.