5 citations · 5 across the 2 of their papers we have counts for
6 papers · 1 filter
Edge-Isoperimetric Inequalities in Chamber Graphs of Hyperplane Arrangements
Tilen Marc
We study edge-isoperimetric inequalities in chamber graphs of affine hyperplane arrangements. Our approach is topological: to a set of chambers we associate its thickening in Eucli…
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…
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs
Sandi Klavžar, Kolja Knauer, Tilen Marc
It was recently pointed out that certain SiO layer structures and SiO nanotubes can be described as full subdivisions aka subdivision graphs of partial cubes. A key tool fo…
The variety of domination games
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
Domination game [SIAM J.\ Discrete Math.\ 24 (2010) 979--991] and total domination game [Graphs Combin.\ 31 (2015) 1453--1462] are by now well established games played on graphs by…
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…
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…