THE FORCING HOP DOMINATION NUMBER OF A GRAPH

DOI10.17654/DM025010055zbMath1499.05178OpenAlexW3087825817MaRDI QIDQ5075602

S. Joseph Robin, D. Anusha

Publication date: 16 May 2022

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

Full work available at URL: https://doi.org/10.17654/dm025010055

zbMATH Keywords

distancehop domination numberforcing hop domination number

Mathematics Subject Classification ID

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

Related Items (1)

The geodetic hop domination number of complementary prisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total and forcing total edge-to-vertex monophonic number of a graph
• THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
• On the forcing geodetic and forcing Steiner numbers of a graph
• The forcing Steiner number of a graph
• The upper edge geodetic number and the forcing edge geodetic number of a graph
• The forcing geodetic number of a graph
• The forcing near geodetic number of a graph

This page was built for publication: THE FORCING HOP DOMINATION NUMBER OF A GRAPH