Doubly connected bi-domination in graphs

DOI10.1142/S1793830921500099zbMath1475.05126OpenAlexW3049446609MaRDI QIDQ5012806

Mohammed A. Abdlhusein

Publication date: 25 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500099

zbMATH Keywords

doubly connected dominating setbi-dominationinverse bi-domination

Mathematics Subject Classification ID

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

Related Items (3)

Total vertex-edge domination in graphs: Complexity and algorithms ⋮ On connected co-independent domination in the join, corona and lexicographic product of graphs ⋮ Total pitchfork domination and its inverse in graphs

Cites Work

• Introduction to ``Topics on Domination
• On \(\alpha \)-domination in graphs
• Basic graph theory
• \([1,2\)-sets in graphs]
• On the doubly connected domination number of a graph
• Pitchfork domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Doubly connected bi-domination in graphs