Hop domination in graphs. II
From MaRDI portal
Publication:2806683
zbMATH Open1349.05260MaRDI QIDQ2806683FDOQ2806683
Authors: C. Natarajan, S. K. Ayyaswamy 
Publication date: 18 May 2016
Published in: Analele Științifice ale Universității ``Ovidius Constanța. Seria: Matematică (Search for Journal in Brave)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)
Cited In (21)
- On Hop Roman Domination in Trees
- Non split hop domination number for some mirror graphs and Cartesian product of two distinct paths
- CONNECTED PERFECT HOP DOMINATING SETS UNDER SOME BINARY OPERATIONS
- Algorithm and hardness results on hop domination in graphs
- Hop total Roman domination in graphs
- The geodetic hop domination number of complementary prisms
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Further results on the hop domination number of a graph
- On the complexity of some hop domination parameters
- Double hop dominating sets in graphs
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
- Hop domination polynomial of graphs
- Clone hop domination number of a graph
- Bounds on the hop domination number of a tree
- Title not available (Why is that?)
- Connected hop domination in graphs under some binary operations
- On total domination and hop domination in diamond-free graphs
- ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES
- On 2-step and hop dominating sets in graphs
- Edge-vertex domination on interval graphs
- THE FORCING HOP DOMINATION NUMBER OF A GRAPH
This page was built for publication: Hop domination in graphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806683)
