Vesna Irsic Chenoweth

collaborators

3 papers

math.CO2025

Revisiting $d$ -distance (independent) domination in trees and in bipartite graphs

Csilla BujtÃ¡s, Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar +1

The $d$ -distance $p$ -packing domination number $Î³_d^p(G)$ of $G$ is the minimum size of a set of vertices of $G$ which is both a $d$ -distance dominating set and a $p$ -packing. In…

math.CO2024

Weighted Padovan graphs

Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar, Gregor Rus +1

Weighted Padovan graphs $I^¦_{k}^{n}$ , $n \geq 1$ , $⌊ \frac{n}{2} ⌋ \leq k \leq ⌊ \frac{2 n - 2}{3} ⌋$ , are introduced as the graphs whose vertices are all Pado…

math.CO2024

Subgraph-universal planar graphs for trees

Helena Bergold, Vesna IrÅ¡iÄ, Robert Lauff +3

We show that there exists an outerplanar graph on $O (n^{c})$ vertices for $c = lo g_{2} (3 + 10) \approx 2.623$ that contains every tree on $n$ vertices as a subgraph. This exten…

Revisiting d-distance (independent) domination in trees and in bipartite graphs

Weighted Padovan graphs

Subgraph-universal planar graphs for trees

Revisiting $d$ -distance (independent) domination in trees and in bipartite graphs