Adriana Roux

According to our database, Adriana Roux authored at least 11 papers between 2013 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Zero forcing irredundant sets.

Bryan Curtis, Leslie Hogben, Adriana Roux

Australas. J Comb., June, 2026

Binary trees with extremal number of maximal independent sets.

Opeyemi Oyewumi, Adriana Roux, Stephan Wagner

Discret. Math., 2026

2025

2-Domination edge subdivision in trees.

Magda Dettlaff, Michael A. Henning, Magdalena Lemanska, Adriana Roux, Jerzy Topp

Australas. J Comb., October, 2025

2024

A new approach to b-coloring of regular graphs.

Magda Dettlaff, Hanna Furmanczyk, Iztok Peterin, Adriana Roux, Radoslaw Ziemann

Appl. Math. Comput., 2024

2022

Irredundance trees of diameter 3.

Christina M. Mynhardt, Adriana Roux

Discret. Math., 2022

Irredundance graphs.

Christina M. Mynhardt, Adriana Roux

Discret. Appl. Math., 2022

2021

The localization game on Cartesian products.

Jeandré Boshoff, Adriana Roux

Discret. Appl. Math., 2021

2019

Connected k-dominating graphs.

Christina M. Mynhardt, L. E. Teshima, Adriana Roux

Discret. Math., 2019

2017

Dominating and irredundant broadcasts in graphs.

Christina M. Mynhardt, Adriana Roux

Discret. Appl. Math., 2017

2014

Upper bounds on the balanced 〈r, s〉-domination number of a graph.

Adriana Roux, Jan H. van Vuuren

Discret. Appl. Math., 2014

2013

Coalescence and criticality of graphs.

Paul J. P. Grobler, Adriana Roux

Discret. Math., 2013