On disjunctive domination in graphs
From MaRDI portal
Publication:5221839
DOI10.2989/16073606.2018.1547797zbMATH Open1436.05083OpenAlexW2910197121WikidataQ128576325 ScholiaQ128576325MaRDI QIDQ5221839FDOQ5221839
Authors: 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
Recommendations
- Disjunctive total domination in graphs
- Domination versus disjunctive domination in graphs
- Algorithmic aspects of disjunctive domination in graphs
- The disjunctive domination number of a graph
- Disjoint dominating and total dominating sets in graphs
- Disjunctive domination in graphs with minimum degree at least two
- scientific article; zbMATH DE number 1229626
- Algorithmic aspects of disjunctive total domination in graphs
- On Domination in Graphs
- Disjunctive total domination in permutation graphs
disjunctive total dominating setdisjunctive total domination numberdisjunctive dominating setdisjunctive domination number
Cites Work
- Title not available (Why is that?)
- Disjunctive total domination in graphs
- The disjunctive domination number of a graph
- Total domination in graphs
- Total domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- Title not available (Why is that?)
- On graphs with equal domination and 2-domination numbers
- Bounds on the distance two-domination number of a graph
- Domination with exponential decay
- An extremal problem for total domination stable graphs upon edge removal
- Title not available (Why is that?)
- Graphs with large disjunctive total domination number
- Bounds on the disjunctive total domination number of a tree
- On the total \(k\)-domination in graphs
- On the total \(k\)-domination number of graphs
- Total \(k\)-distance domination critical graphs
- Secondary domination in graphs
- Neighborhood total 2-domination in graphs
Cited In (14)
- Disjunctive total domination in graphs
- Title not available (Why is that?)
- Algorithmic aspects of paired disjunctive domination in graphs
- Dierentiating-Dominating sets in graphs Under binary operations
- Domination in the corona and join of graphs
- Disjunctive total domination stability in graphs
- The disjunctive bondage number and the disjunctive total bondage number of graphs
- Vertices contained in all or in no minimum disjunctive dominating set of a tree
- Disjunctive domination in graphs with minimum degree at least two
- The disjunctive domination number of a graph
- Disjunctive total domination in permutation graphs
- A note on disjoint dominating sets in graphs
- Domination versus disjunctive domination in graphs
- Title not available (Why is that?)
This page was built for publication: On disjunctive domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221839)
