81 citations · 214 across the 80 of their papers we have counts for
9 papers · 1 filter
On Grundy total domination number in product graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
A longest sequence of vertices of a graph is a Grundy total dominating sequence of if for all , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…
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…
Game Total Domination Critical Graphs
Michael A. Henning, Sandi Klavžar, Douglas F. Rall
In the total domination game played on a graph , players Dominator and Staller alternately select vertices of , as long as possible, such that each vertex chosen increases th…
Embeddings into almost self-centered graphs of given radius
Kexiang Xu, Haiqiong Liu, Kinkar Ch. Das +1
A graph is almost self-centered (ASC) if all but two of its vertices are central. An almost self-centered graph with radius is called an -ASC graph. The -ASC index $θ_r(G…
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…