Joanna Raczek

dblp:15/2304 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
1since 2021 · last 2024
0000-0002-1807-4978ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 3 first-author · 1 since 2021
YearPublicationVenuePosition
2024 Complexity Issues on of Secondary Domination Number
abstract
Abstract In this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding a minimum secondary dominating set in trees is presented.
Joanna Raczek
Algorithmica1
2019 Weakly connected Roman domination in graphs
Joanna Raczek, Joanna Cyman
Discret. Appl. Math.1
2011 A note on total reinforcement in graphs
Michael A. Henning, Nader Jafari Rad, Joanna Raczek
Discret. Appl. Math.3
2010 A note on the weakly convex and convex domination numbers of a torus
Joanna Raczek, Magdalena Lemanska
Discret. Appl. Math.1
2009 Total outer-connected domination numbers of trees
Joanna Cyman, Joanna Raczek
Discret. Appl. Math.2