A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a
longer geodesic. The geodesic-transversal problem in a graph G is introduced as the task to …

The modular product\(G\diamond H\) of graphs G and H is a graph on vertex set\(V (G)\times
V (H)\). Two vertices (g, h) and\((g', h')\) of\(G\diamond H\) are adjacent if\(g= g'\) and\(hh'\in E …

We study the problem of computing a group of k vertices that covers a maximum number of
shortest paths in a graph in the context of network centrality. In Group Coverage Centrality …

A geodesic packing of a graph G is a set of vertex-disjoint maximal geodesics. The
maximum cardinality of a geodesic packing is the geodesic packing number gpack (G). It is …

A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G
contains at least one vertex of S. We determine a smallest geodesic transversal in certain …

A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G
contains at least one vertex of S. The minimum cardinality of a geodesic transversal of G is …