1 citations · 1 across the 4 of their papers we have counts for
4 papers
General Position Problem of Butterfly Networks
R. Prabha, S. Renukaa Devi, Paul Manuel
A general position set S is a set S of vertices in G(V,E) such that no three vertices of S lie on a shortest path in G. Such a set of maximum size in G is called a gpset of G and i…
The geodesic cover problem for butterfly networks
Paul Manuel, Sandi Klavzar, R. Prabha +1
A geodesic cover, also known as an isometric path cover, of a graph is a set of geodesics which cover the vertex set of the graph. An edge geodesic cover of a graph is a set of geo…
Generalization of edge general position problem
Paul Manuel, R. Prabha, Sandi Klavzar
The edge geodesic cover problem of a graph is to find a smallest number of geodesics that cover the edge set of . The edge -general position problem is introduced as the…
Edge general position problem
Paul Manuel, R. Prabha, Sandi Klavžar
Given a graph , the general position problem is to find a largest set of vertices of such that no three vertices of lie on a common geodesic. Such a set is called a…