81 citations · 214 across the 80 of their papers we have counts for
15 papers · 1 filter
-conjectures on the domination game and claw-free graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
Let be the game domination number of a graph . Rall conjectured that if is a traceable graph, then . Our main re…
Total connected domination game
Csilla Bujtás, Michael A. Henning, Vesna Iršič +1
The (total) connected domination game on a graph is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirem…
The general position number of the Cartesian product of two trees
Jing Tian, Kexiang Xu, Sandi Klavžar
The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest…
The domination game played on diameter 2 graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
Let be the game domination number of a graph . It is proved that if , then $γ_g(G) \le \left\lceil \frac{n(G)}{2} \right\rceil- \left\lfloor \frac{n(…
The Steiner -eccentricity on trees
Xingfu Li, Guihai Yu, Sandi Klavžar +2
We study the Steiner -eccentricity on trees, which generalizes the previous one in the paper [X.~Li, G.~Yu, S.~Klavžar, On the average Steiner 3-eccentricity of trees, arXiv:200…
Some extremal results on the chromatic-stability index
Shenwei Huang, Sandi Klavžar, Hui Lei +2
The -stability index of a graph is the minimum number of its edges whose removal results in a graph with the chromatic number smaller than that of . In th…