On disjunctive domination in graphs
From MaRDI portal
Publication:5221839
DOI10.2989/16073606.2018.1547797zbMath1436.05083OpenAlexW2910197121WikidataQ128576325 ScholiaQ128576325MaRDI QIDQ5221839
Ferdinand P. Jamil, Rolando P. Malalay
Publication date: 3 April 2020
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073606.2018.1547797
disjunctive total dominating setdisjunctive total domination numberdisjunctive dominating setdisjunctive domination number
Related Items (2)
Disjunctive domination in graphs with minimum degree at least two ⋮ Algorithmic aspects of paired disjunctive domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjunctive total domination in graphs
- An extremal problem for total domination stable graphs upon edge removal
- Bounds on the disjunctive total domination number of a tree
- Secondary domination in graphs
- Domination with exponential decay
- On the total \(k\)-domination in graphs
- Bounds on the distance two-domination number of a graph
- On graphs with equal domination and 2-domination numbers
- The disjunctive domination number of a graph
- Total domination in graphs
- Towards a theory of domination in graphs
- On the total k-domination number of graphs
- Total Domination in Graphs
- Total $k$-distance domination critical graphs
- Graphs with Large Disjunctive Total Domination Number
This page was built for publication: On disjunctive domination in graphs
