5 citations · 5 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
On the Independence Number of the Modular Product
Tanja Dravec, Iztok Peterin
The \emph{modular product} of graphs and is a graph on vertex set . Two vertices and of are adjacent if $g=g'…
math.CO2025
On the stress transit function
Arun Anil, Manoj Changat, Tanja Dravec +5
The stress interval between is the set of all vertices in a graph that lie on every shortest -path. A set is stress convex if $S(…
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…