Dierentiating-Dominating sets in graphs Under binary operations

DOI10.5556/J.TKJM.46.2015.1553zbMATH Open1321.05179OpenAlexW2060603116MaRDI QIDQ5263321FDOQ5263321

Authors: S. R. Canoy, Gina Malacas 

Publication date: 16 July 2015

Published in: Tamkang Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5556/j.tkjm.46.2015.1553

Recommendations

• (1, 2)-DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS
• MOVABLE DIFFERENTIATING-DOMINATION IN GRAPHS
• Forcing domination numbers of graphs under some binary operations
• On the domination polynomial of some graph operations
• On disjunctive domination in graphs
• On total dominating sets in graphs
• \(A\)-differentials and total domination in graphs
• DOWNHILL DOMINATION IN GRAPHS UNDER BINARY OPERATIONS
• Disjoint dominating and total dominating sets in graphs
• Algorithmic aspects of disjunctive domination in graphs

zbMATH Keywords

graphdominatingdifferentiatingdifferentiating-dominatingstrictly differentiating

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (3)

• Locating-hop domination in graphs
• DOWNHILL DOMINATION IN GRAPHS UNDER BINARY OPERATIONS
• MOVABLE DIFFERENTIATING-DOMINATION IN GRAPHS

This page was built for publication: Dierentiating-Dominating sets in graphs Under binary operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263321)