4 citations · 7 across the 7 of their papers we have counts for
4 papers · 1 filter
The graph theory general position problem on some interconnection networks
Paul Manuel, Sandi Klavžar
Given a graph , the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant…
Graph theory general position problem
Paul Manuel, Sandi Klavžar
The classical no-three-in-line problem is to find the maximum number of points that can be placed in the grid so that no three points lie on a line. Given a set of…
Strong geodetic problem in grid like architectures
Sandi Klavžar, Paul Manuel
A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If is a graph, then is the cardinality of a smallest ver…
Strong geodetic problem in networks: computational complexity and solution for Apollonian networks
Paul Manuel, Sandi Klavžar, Antony Xavier +2
The geodetic problem was introduced by Harary et al. In order to model some social network problems, a similar problem is introduced in this paper and named the strong geodetic pro…