On \(\alpha \)-domination in graphs
From MaRDI portal
Publication:1706432
DOI10.1007/s00373-017-1869-1zbMath1390.05161OpenAlexW2777574513MaRDI QIDQ1706432
Angsuman Das, Nader Jafari Rad, Renu C. Laskar
Publication date: 22 March 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1869-1
Related Items
Partial domination in supercubic graphs, On \(\alpha\)-split domination in graphs, Applying the (1,2)-pitchfork domination and it's inverse on some special graphs, Some modified types of pitchfork domination and it's inverse, Connected domination value in graphs, Pitchfork domination in graphs, Doubly connected bi-domination in graphs, Total pitchfork domination and its inverse in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-removal and edge-addition in \(\alpha \)-domination
- Upper bounds for \(\alpha \)-domination parameters
- \(\alpha \)-domination perfect trees
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- On graphs with equal domination and covering numbers
- Local majorities, coalitions and monopolies in graphs: A review
- \(\alpha\)-domination
- Vertex-removal in α-domination
- Some remarks on alpha-domination
- Highly connected counterexamples to a conjecture on α -domination