5 citations · 5 across the 1 of their papers we have counts for
3 papers
math.CO2019★ 5 cited
On graphs with equal total domination and Grundy total domination number
Tanja Gologranc, Marko Jakovac, Tim Kos +1
A sequence of vertices in a graph without isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at…
math.CO2017
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…
math.CO2016
There is no (95,40,12,20) strongly regular graph
Jernej Azarija, Tilen Marc
We show that there is no strongly regular graph and, consequently, there is no strongly regular graph, no two-graph on vertices, and no partial…